/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/veris.c_sendmail_tTflag_arr_one_loop.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:07:27,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:07:27,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:07:27,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:07:27,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:07:27,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:07:27,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:07:27,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:07:27,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:07:27,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:07:27,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:07:27,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:07:27,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:07:27,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:07:27,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:07:27,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:07:27,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:07:27,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:07:27,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:07:27,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:07:27,269 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:07:27,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:07:27,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:07:27,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:07:27,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:07:27,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:07:27,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:07:27,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:07:27,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:07:27,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:07:27,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:07:27,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:07:27,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:07:27,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:07:27,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:07:27,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:07:27,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:07:27,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:07:27,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:07:27,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:07:27,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:07:27,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:07:27,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:07:27,297 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:07:27,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:07:27,299 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:07:27,299 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:07:27,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:07:27,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:07:27,300 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:07:27,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:07:27,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:07:27,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:07:27,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:07:27,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:07:27,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:07:27,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:07:27,301 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:07:27,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:07:27,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:07:27,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:07:27,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:07:27,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:07:27,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:07:27,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:07:27,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:07:27,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:07:27,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:07:27,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:07:27,303 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:07:27,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:07:27,304 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:07:27,304 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 00:07:27,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:07:27,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:07:27,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:07:27,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:07:27,539 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:07:27,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_sendmail_tTflag_arr_one_loop.c [2022-04-15 00:07:27,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b40a20e2/e48a435c37e242b5a9ef51df2fe836b9/FLAG207a671cd [2022-04-15 00:07:27,952 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:07:27,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_sendmail_tTflag_arr_one_loop.c [2022-04-15 00:07:27,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b40a20e2/e48a435c37e242b5a9ef51df2fe836b9/FLAG207a671cd [2022-04-15 00:07:27,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b40a20e2/e48a435c37e242b5a9ef51df2fe836b9 [2022-04-15 00:07:27,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:07:27,972 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:07:27,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:07:27,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:07:27,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:07:27,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:07:27" (1/1) ... [2022-04-15 00:07:27,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3c1bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:27, skipping insertion in model container [2022-04-15 00:07:27,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:07:27" (1/1) ... [2022-04-15 00:07:27,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:07:27,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:07:28,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_sendmail_tTflag_arr_one_loop.c[386,399] [2022-04-15 00:07:28,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:07:28,163 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:07:28,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_sendmail_tTflag_arr_one_loop.c[386,399] [2022-04-15 00:07:28,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:07:28,197 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:07:28,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:28 WrapperNode [2022-04-15 00:07:28,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:07:28,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:07:28,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:07:28,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:07:28,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:28" (1/1) ... [2022-04-15 00:07:28,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:28" (1/1) ... [2022-04-15 00:07:28,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:28" (1/1) ... [2022-04-15 00:07:28,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:28" (1/1) ... [2022-04-15 00:07:28,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:28" (1/1) ... [2022-04-15 00:07:28,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:28" (1/1) ... [2022-04-15 00:07:28,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:28" (1/1) ... [2022-04-15 00:07:28,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:07:28,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:07:28,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:07:28,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:07:28,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:28" (1/1) ... [2022-04-15 00:07:28,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:07:28,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:07:28,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 00:07:28,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 00:07:28,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:07:28,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:07:28,291 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:07:28,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:07:28,291 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:07:28,291 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:07:28,291 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:07:28,291 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 00:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 00:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:07:28,337 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:07:28,338 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:07:28,517 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:07:28,522 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:07:28,522 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 00:07:28,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:07:28 BoogieIcfgContainer [2022-04-15 00:07:28,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:07:28,523 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:07:28,523 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:07:28,524 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:07:28,526 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:07:28" (1/1) ... [2022-04-15 00:07:28,527 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:07:28,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:07:28 BasicIcfg [2022-04-15 00:07:28,559 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:07:28,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:07:28,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:07:28,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:07:28,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:07:27" (1/4) ... [2022-04-15 00:07:28,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8fdf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:07:28, skipping insertion in model container [2022-04-15 00:07:28,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:28" (2/4) ... [2022-04-15 00:07:28,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8fdf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:07:28, skipping insertion in model container [2022-04-15 00:07:28,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:07:28" (3/4) ... [2022-04-15 00:07:28,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8fdf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:07:28, skipping insertion in model container [2022-04-15 00:07:28,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:07:28" (4/4) ... [2022-04-15 00:07:28,564 INFO L111 eAbstractionObserver]: Analyzing ICFG veris.c_sendmail_tTflag_arr_one_loop.cqvasr [2022-04-15 00:07:28,567 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:07:28,567 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:07:28,620 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:07:28,633 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 00:07:28,633 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:07:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 00:07:28,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:07:28,649 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:07:28,649 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:07:28,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:07:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash -468929206, now seen corresponding path program 1 times [2022-04-15 00:07:28,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:07:28,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001460702] [2022-04-15 00:07:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:28,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:07:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:28,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:07:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:28,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= 39 (select |v_#length_3| 2)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-15 00:07:28,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:07:28,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:07:28,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:07:28,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= 39 (select |v_#length_3| 2)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-15 00:07:28,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:07:28,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:07:28,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:07:28,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [58] mainENTRY-->L20-3: Formula: (and (= |v_main_~#in~0.offset_2| 0) (= (select |v_#valid_2| |v_main_~#in~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#in~0.base_2|) (= v_main_~i~0_2 0) (= (store |v_#valid_2| |v_main_~#in~0.base_2| 1) |v_#valid_1|) (not (= |v_main_~#in~0.base_2| 0)) (= (store |v_#length_2| |v_main_~#in~0.base_2| 11) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~#in~0.offset=|v_main_~#in~0.offset_2|, main_~#in~0.base=|v_main_~#in~0.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~s~0.base=v_main_~s~0.base_2, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_2, main_~idx_in~0=v_main_~idx_in~0_2, #length=|v_#length_1|, main_~s~0.offset=v_main_~s~0.offset_2} AuxVars[] AssignedVars[main_~#in~0.offset, main_~#in~0.base, main_~s~0.base, main_~j~0, #valid, main_~i~0, main_~c~0, main_~idx_in~0, #length, main_~s~0.offset] {25#true} is VALID [2022-04-15 00:07:28,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [60] L20-3-->L20-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:07:28,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} [63] L20-4-->L29-2: Formula: (and (= v_main_~s~0.base_1 |v_main_~#in~0.base_1|) (= v_main_~s~0.offset_1 |v_main_~#in~0.offset_1|) (= v_main_~i~0_1 0) (= (store |v_#memory_int_2| |v_main_~#in~0.base_1| (store (select |v_#memory_int_2| |v_main_~#in~0.base_1|) (+ |v_main_~#in~0.offset_1| 10) 0)) |v_#memory_int_1|) (= v_main_~idx_in~0_1 0) (= v_main_~c~0_1 (select (select |v_#memory_int_1| |v_main_~#in~0.base_1|) (+ |v_main_~#in~0.offset_1| v_main_~idx_in~0_1)))) InVars {#memory_int=|v_#memory_int_2|, main_~#in~0.offset=|v_main_~#in~0.offset_1|, main_~#in~0.base=|v_main_~#in~0.base_1|} OutVars{main_~#in~0.offset=|v_main_~#in~0.offset_1|, main_~#in~0.base=|v_main_~#in~0.base_1|, main_~s~0.base=v_main_~s~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_1, main_~c~0=v_main_~c~0_1, main_~idx_in~0=v_main_~idx_in~0_1, main_#t~mem6=|v_main_#t~mem6_1|, main_~s~0.offset=v_main_~s~0.offset_1} AuxVars[] AssignedVars[main_~s~0.base, #memory_int, main_~i~0, main_~c~0, main_~idx_in~0, main_#t~mem6, main_~s~0.offset] {26#false} is VALID [2022-04-15 00:07:28,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [65] L29-2-->L29-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:07:28,772 INFO L272 TraceCheckUtils]: 9: Hoare triple {26#false} [68] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| 1) InVars {main_~i~0=v_main_~i~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {26#false} is VALID [2022-04-15 00:07:28,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [70] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-15 00:07:28,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [72] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:07:28,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} [74] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:07:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:28,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:07:28,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001460702] [2022-04-15 00:07:28,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001460702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:07:28,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:07:28,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:07:28,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660324873] [2022-04-15 00:07:28,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:07:28,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 00:07:28,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:07:28,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:28,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:28,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:07:28,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:07:28,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:07:28,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:07:28,820 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:28,902 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-15 00:07:28,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:07:28,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 00:07:28,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:07:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-15 00:07:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-15 00:07:28,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2022-04-15 00:07:28,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:28,978 INFO L225 Difference]: With dead ends: 36 [2022-04-15 00:07:28,978 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 00:07:28,981 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:07:28,984 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:07:28,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:07:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 00:07:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 00:07:29,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:07:29,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:29,007 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:29,008 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:29,012 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 00:07:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 00:07:29,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:29,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:29,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 00:07:29,014 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 00:07:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:29,020 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 00:07:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 00:07:29,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:29,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:29,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:07:29,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:07:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 00:07:29,027 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2022-04-15 00:07:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:07:29,028 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 00:07:29,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 00:07:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 00:07:29,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:07:29,028 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:07:29,029 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:07:29,029 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:07:29,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:07:29,029 INFO L85 PathProgramCache]: Analyzing trace with hash 419497996, now seen corresponding path program 1 times [2022-04-15 00:07:29,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:07:29,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965458112] [2022-04-15 00:07:29,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:07:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:29,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:07:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:29,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= 39 (select |v_#length_3| 2)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {133#true} is VALID [2022-04-15 00:07:29,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-15 00:07:29,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {133#true} {133#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-15 00:07:29,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {133#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:07:29,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= 39 (select |v_#length_3| 2)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {133#true} is VALID [2022-04-15 00:07:29,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-15 00:07:29,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133#true} {133#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-15 00:07:29,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {133#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-15 00:07:29,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {133#true} [58] mainENTRY-->L20-3: Formula: (and (= |v_main_~#in~0.offset_2| 0) (= (select |v_#valid_2| |v_main_~#in~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#in~0.base_2|) (= v_main_~i~0_2 0) (= (store |v_#valid_2| |v_main_~#in~0.base_2| 1) |v_#valid_1|) (not (= |v_main_~#in~0.base_2| 0)) (= (store |v_#length_2| |v_main_~#in~0.base_2| 11) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~#in~0.offset=|v_main_~#in~0.offset_2|, main_~#in~0.base=|v_main_~#in~0.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~s~0.base=v_main_~s~0.base_2, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_2, main_~idx_in~0=v_main_~idx_in~0_2, #length=|v_#length_1|, main_~s~0.offset=v_main_~s~0.offset_2} AuxVars[] AssignedVars[main_~#in~0.offset, main_~#in~0.base, main_~s~0.base, main_~j~0, #valid, main_~i~0, main_~c~0, main_~idx_in~0, #length, main_~s~0.offset] {133#true} is VALID [2022-04-15 00:07:29,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {133#true} [61] L20-3-->L20-4: Formula: (not (< (mod v_main_~i~0_4 4294967296) 10)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-15 00:07:29,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#true} [63] L20-4-->L29-2: Formula: (and (= v_main_~s~0.base_1 |v_main_~#in~0.base_1|) (= v_main_~s~0.offset_1 |v_main_~#in~0.offset_1|) (= v_main_~i~0_1 0) (= (store |v_#memory_int_2| |v_main_~#in~0.base_1| (store (select |v_#memory_int_2| |v_main_~#in~0.base_1|) (+ |v_main_~#in~0.offset_1| 10) 0)) |v_#memory_int_1|) (= v_main_~idx_in~0_1 0) (= v_main_~c~0_1 (select (select |v_#memory_int_1| |v_main_~#in~0.base_1|) (+ |v_main_~#in~0.offset_1| v_main_~idx_in~0_1)))) InVars {#memory_int=|v_#memory_int_2|, main_~#in~0.offset=|v_main_~#in~0.offset_1|, main_~#in~0.base=|v_main_~#in~0.base_1|} OutVars{main_~#in~0.offset=|v_main_~#in~0.offset_1|, main_~#in~0.base=|v_main_~#in~0.base_1|, main_~s~0.base=v_main_~s~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_1, main_~c~0=v_main_~c~0_1, main_~idx_in~0=v_main_~idx_in~0_1, main_#t~mem6=|v_main_#t~mem6_1|, main_~s~0.offset=v_main_~s~0.offset_1} AuxVars[] AssignedVars[main_~s~0.base, #memory_int, main_~i~0, main_~c~0, main_~idx_in~0, main_#t~mem6, main_~s~0.offset] {133#true} is VALID [2022-04-15 00:07:29,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#true} [66] L29-2-->L29-3: Formula: (let ((.cse0 (mod v_main_~c~0_3 256))) (or (not (<= .cse0 57)) (not (<= 48 .cse0)))) InVars {main_~c~0=v_main_~c~0_3} OutVars{main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[] {133#true} is VALID [2022-04-15 00:07:29,166 INFO L272 TraceCheckUtils]: 9: Hoare triple {133#true} [68] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| 1) InVars {main_~i~0=v_main_~i~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {138#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-15 00:07:29,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {138#(= |__VERIFIER_assert_#in~cond| 1)} [70] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {139#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-15 00:07:29,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {139#(= __VERIFIER_assert_~cond 1)} [72] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {134#false} is VALID [2022-04-15 00:07:29,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {134#false} [74] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#false} is VALID [2022-04-15 00:07:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:29,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:07:29,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965458112] [2022-04-15 00:07:29,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965458112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:07:29,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:07:29,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 00:07:29,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942172669] [2022-04-15 00:07:29,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:07:29,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 00:07:29,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:07:29,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:29,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:29,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 00:07:29,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:07:29,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 00:07:29,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:07:29,186 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:29,268 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 00:07:29,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:07:29,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 00:07:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:07:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-15 00:07:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-15 00:07:29,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 16 transitions. [2022-04-15 00:07:29,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:29,286 INFO L225 Difference]: With dead ends: 15 [2022-04-15 00:07:29,287 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:07:29,290 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:07:29,295 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:07:29,295 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:07:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:07:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:07:29,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:07:29,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:07:29,297 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:07:29,297 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:07:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:29,297 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:07:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:07:29,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:29,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:29,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:07:29,298 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:07:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:29,298 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:07:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:07:29,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:29,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:29,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:07:29,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:07:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:07:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:07:29,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-15 00:07:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:07:29,300 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:07:29,300 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:07:29,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:29,302 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:07:29,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:07:29,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:07:29,319 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:07:29,319 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:07:29,319 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:07:29,319 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:07:29,319 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:07:29,320 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:07:29,320 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:07:29,320 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 12 39) the Hoare annotation is: true [2022-04-15 00:07:29,320 INFO L885 garLoopResultBuilder]: At program point L20-3(lines 20 22) the Hoare annotation is: true [2022-04-15 00:07:29,320 INFO L882 garLoopResultBuilder]: For program point L20-4(lines 20 22) no Hoare annotation was computed. [2022-04-15 00:07:29,320 INFO L882 garLoopResultBuilder]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2022-04-15 00:07:29,320 INFO L885 garLoopResultBuilder]: At program point L29-2(lines 29 35) the Hoare annotation is: true [2022-04-15 00:07:29,320 INFO L885 garLoopResultBuilder]: At program point L29-3(lines 29 35) the Hoare annotation is: true [2022-04-15 00:07:29,320 INFO L882 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-15 00:07:29,320 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 12 39) no Hoare annotation was computed. [2022-04-15 00:07:29,320 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 12 39) no Hoare annotation was computed. [2022-04-15 00:07:29,321 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-15 00:07:29,321 INFO L882 garLoopResultBuilder]: For program point L7(lines 7 9) no Hoare annotation was computed. [2022-04-15 00:07:29,321 INFO L882 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-15 00:07:29,321 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2022-04-15 00:07:29,321 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-04-15 00:07:29,321 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2022-04-15 00:07:29,323 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-15 00:07:29,324 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:07:29,327 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:07:29,327 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:07:29,327 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:07:29,327 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-15 00:07:29,327 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-15 00:07:29,327 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-15 00:07:29,327 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:07:29,327 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:07:29,328 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:07:29,328 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-15 00:07:29,328 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-15 00:07:29,328 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 00:07:29,328 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 00:07:29,328 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-15 00:07:29,328 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:07:29,328 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 00:07:29,328 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:07:29,328 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:07:29,328 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:07:29,328 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:07:29,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:07:29 BasicIcfg [2022-04-15 00:07:29,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:07:29,333 INFO L158 Benchmark]: Toolchain (without parser) took 1360.04ms. Allocated memory was 205.5MB in the beginning and 270.5MB in the end (delta: 65.0MB). Free memory was 152.3MB in the beginning and 240.2MB in the end (delta: -88.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:07:29,333 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:07:29,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.10ms. Allocated memory is still 205.5MB. Free memory was 152.1MB in the beginning and 180.4MB in the end (delta: -28.3MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-15 00:07:29,333 INFO L158 Benchmark]: Boogie Preprocessor took 32.65ms. Allocated memory is still 205.5MB. Free memory was 180.4MB in the beginning and 179.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:07:29,333 INFO L158 Benchmark]: RCFGBuilder took 290.88ms. Allocated memory is still 205.5MB. Free memory was 179.0MB in the beginning and 167.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 00:07:29,334 INFO L158 Benchmark]: IcfgTransformer took 36.12ms. Allocated memory is still 205.5MB. Free memory was 167.4MB in the beginning and 165.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:07:29,334 INFO L158 Benchmark]: TraceAbstraction took 771.25ms. Allocated memory was 205.5MB in the beginning and 270.5MB in the end (delta: 65.0MB). Free memory was 165.3MB in the beginning and 240.2MB in the end (delta: -74.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:07:29,335 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.10ms. Allocated memory is still 205.5MB. Free memory was 152.1MB in the beginning and 180.4MB in the end (delta: -28.3MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.65ms. Allocated memory is still 205.5MB. Free memory was 180.4MB in the beginning and 179.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 290.88ms. Allocated memory is still 205.5MB. Free memory was 179.0MB in the beginning and 167.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 36.12ms. Allocated memory is still 205.5MB. Free memory was 167.4MB in the beginning and 165.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 771.25ms. Allocated memory was 205.5MB in the beginning and 270.5MB in the end (delta: 65.0MB). Free memory was 165.3MB in the beginning and 240.2MB in the end (delta: -74.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 35 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 14 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 00:07:29,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...