./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule60_list2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/rule60_list2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10cd30ad3ca5cbac349bf58887b96141941b6c91 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:58:16,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:58:16,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:58:16,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:58:16,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:58:16,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:58:16,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:58:16,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:58:16,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:58:16,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:58:16,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:58:16,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:58:16,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:58:16,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:58:16,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:58:16,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:58:16,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:58:16,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:58:16,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:58:16,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:58:16,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:58:16,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:58:16,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:58:16,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:58:16,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:58:16,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:58:16,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:58:16,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:58:16,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:58:16,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:58:16,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:58:16,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:58:16,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:58:16,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:58:16,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:58:16,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:58:16,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:58:16,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:58:16,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:58:16,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:58:16,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:58:16,678 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:58:16,705 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:58:16,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:58:16,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:58:16,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:58:16,712 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:58:16,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:58:16,713 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:58:16,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:58:16,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:58:16,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:58:16,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:58:16,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:58:16,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:58:16,717 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:58:16,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:58:16,719 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:58:16,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:58:16,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:58:16,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:58:16,720 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:58:16,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:58:16,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:58:16,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:58:16,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:58:16,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:58:16,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:58:16,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:58:16,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:58:16,723 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:58:16,723 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10cd30ad3ca5cbac349bf58887b96141941b6c91 [2020-07-28 17:58:17,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:58:17,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:58:17,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:58:17,127 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:58:17,127 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:58:17,128 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule60_list2.i [2020-07-28 17:58:17,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772318379/3083fc326962424dbabe9a6375d35590/FLAG10b561b5b [2020-07-28 17:58:17,753 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:58:17,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i [2020-07-28 17:58:17,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772318379/3083fc326962424dbabe9a6375d35590/FLAG10b561b5b [2020-07-28 17:58:18,163 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772318379/3083fc326962424dbabe9a6375d35590 [2020-07-28 17:58:18,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:58:18,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:58:18,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:58:18,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:58:18,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:58:18,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:58:18" (1/1) ... [2020-07-28 17:58:18,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6658957f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18, skipping insertion in model container [2020-07-28 17:58:18,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:58:18" (1/1) ... [2020-07-28 17:58:18,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:58:18,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:58:18,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:58:18,619 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:58:18,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:58:18,731 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:58:18,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18 WrapperNode [2020-07-28 17:58:18,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:58:18,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:58:18,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:58:18,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:58:18,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18" (1/1) ... [2020-07-28 17:58:18,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18" (1/1) ... [2020-07-28 17:58:18,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:58:18,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:58:18,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:58:18,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:58:18,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18" (1/1) ... [2020-07-28 17:58:18,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18" (1/1) ... [2020-07-28 17:58:18,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18" (1/1) ... [2020-07-28 17:58:18,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18" (1/1) ... [2020-07-28 17:58:18,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18" (1/1) ... [2020-07-28 17:58:18,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18" (1/1) ... [2020-07-28 17:58:18,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18" (1/1) ... [2020-07-28 17:58:18,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:58:18,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:58:18,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:58:18,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:58:18,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:58:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:58:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-28 17:58:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:58:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:58:19,396 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:58:19,397 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-07-28 17:58:19,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:58:19 BoogieIcfgContainer [2020-07-28 17:58:19,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:58:19,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:58:19,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:58:19,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:58:19,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:58:18" (1/3) ... [2020-07-28 17:58:19,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2811261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:58:19, skipping insertion in model container [2020-07-28 17:58:19,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:18" (2/3) ... [2020-07-28 17:58:19,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2811261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:58:19, skipping insertion in model container [2020-07-28 17:58:19,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:58:19" (3/3) ... [2020-07-28 17:58:19,409 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2020-07-28 17:58:19,420 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:58:19,427 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-07-28 17:58:19,438 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-07-28 17:58:19,459 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:58:19,459 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:58:19,459 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:58:19,459 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:58:19,460 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:58:19,460 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:58:19,460 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:58:19,460 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:58:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-28 17:58:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-28 17:58:19,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:19,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-28 17:58:19,486 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-28 17:58:19,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:19,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034610893] [2020-07-28 17:58:19,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:19,687 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {43#true} is VALID [2020-07-28 17:58:19,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} havoc main_#res;havoc main_#t~ret32.base, main_#t~ret32.offset, main_#t~ret33.base, main_#t~ret33.offset, main_~dev1~0.base, main_~dev1~0.offset, main_~dev2~0.base, main_~dev2~0.offset;havoc main_~dev1~0.base, main_~dev1~0.offset;havoc main_~dev2~0.base, main_~dev2~0.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {45#(= 8 ULTIMATE.start___getMemory_~size)} is VALID [2020-07-28 17:58:19,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {45#(= 8 ULTIMATE.start___getMemory_~size)} assume !(__getMemory_~size > 0); {44#false} is VALID [2020-07-28 17:58:19,691 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-28 17:58:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:19,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034610893] [2020-07-28 17:58:19,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:19,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:58:19,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771951708] [2020-07-28 17:58:19,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-28 17:58:19,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:19,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:58:19,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:19,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:58:19,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:19,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:58:19,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:58:19,732 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-07-28 17:58:19,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:19,857 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2020-07-28 17:58:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:58:19,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-28 17:58:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:58:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-28 17:58:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:58:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-28 17:58:19,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2020-07-28 17:58:20,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:20,034 INFO L225 Difference]: With dead ends: 73 [2020-07-28 17:58:20,034 INFO L226 Difference]: Without dead ends: 30 [2020-07-28 17:58:20,038 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:58:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-28 17:58:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-28 17:58:20,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:20,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:20,077 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:20,077 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:20,081 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-28 17:58:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-28 17:58:20,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:20,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:20,082 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:20,083 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:20,086 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-28 17:58:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-28 17:58:20,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:20,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:20,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:20,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-28 17:58:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-28 17:58:20,092 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 4 [2020-07-28 17:58:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:20,092 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-28 17:58:20,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:58:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-28 17:58:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:58:20,093 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:20,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:20,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:58:20,094 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:20,095 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2020-07-28 17:58:20,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:20,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389250678] [2020-07-28 17:58:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:20,236 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {225#true} is VALID [2020-07-28 17:58:20,236 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} havoc main_#res;havoc main_#t~ret32.base, main_#t~ret32.offset, main_#t~ret33.base, main_#t~ret33.offset, main_~dev1~0.base, main_~dev1~0.offset, main_~dev2~0.base, main_~dev2~0.offset;havoc main_~dev1~0.base, main_~dev1~0.offset;havoc main_~dev2~0.base, main_~dev2~0.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {225#true} is VALID [2020-07-28 17:58:20,237 INFO L280 TraceCheckUtils]: 2: Hoare triple {225#true} assume __getMemory_~size > 0; {225#true} is VALID [2020-07-28 17:58:20,238 INFO L280 TraceCheckUtils]: 3: Hoare triple {225#true} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {225#true} is VALID [2020-07-28 17:58:20,238 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} assume 0 == __getMemory_#t~nondet29;havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := 0, 0; {225#true} is VALID [2020-07-28 17:58:20,238 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#true} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {225#true} is VALID [2020-07-28 17:58:20,239 INFO L280 TraceCheckUtils]: 6: Hoare triple {225#true} main_#t~ret32.base, main_#t~ret32.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev1~0.base, main_~dev1~0.offset := main_#t~ret32.base, main_#t~ret32.offset;havoc main_#t~ret32.base, main_#t~ret32.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {225#true} is VALID [2020-07-28 17:58:20,239 INFO L280 TraceCheckUtils]: 7: Hoare triple {225#true} assume __getMemory_~size > 0; {225#true} is VALID [2020-07-28 17:58:20,240 INFO L280 TraceCheckUtils]: 8: Hoare triple {225#true} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {225#true} is VALID [2020-07-28 17:58:20,241 INFO L280 TraceCheckUtils]: 9: Hoare triple {225#true} assume 0 == __getMemory_#t~nondet29;havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := 0, 0; {227#(and (= 0 |ULTIMATE.start___getMemory_#res.base|) (= 0 |ULTIMATE.start___getMemory_#res.offset|))} is VALID [2020-07-28 17:58:20,243 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#(and (= 0 |ULTIMATE.start___getMemory_#res.base|) (= 0 |ULTIMATE.start___getMemory_#res.offset|))} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {228#(and (= 0 |ULTIMATE.start_my_malloc_#res.base|) (= 0 |ULTIMATE.start_my_malloc_#res.offset|))} is VALID [2020-07-28 17:58:20,244 INFO L280 TraceCheckUtils]: 11: Hoare triple {228#(and (= 0 |ULTIMATE.start_my_malloc_#res.base|) (= 0 |ULTIMATE.start_my_malloc_#res.offset|))} main_#t~ret33.base, main_#t~ret33.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev2~0.base, main_~dev2~0.offset := main_#t~ret33.base, main_#t~ret33.offset;havoc main_#t~ret33.base, main_#t~ret33.offset; {229#(and (= 0 ULTIMATE.start_main_~dev2~0.base) (= 0 ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:20,246 INFO L280 TraceCheckUtils]: 12: Hoare triple {229#(and (= 0 ULTIMATE.start_main_~dev2~0.base) (= 0 ULTIMATE.start_main_~dev2~0.offset))} assume (main_~dev1~0.base != 0 || main_~dev1~0.offset != 0) && (main_~dev2~0.base != 0 || main_~dev2~0.offset != 0);list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {226#false} is VALID [2020-07-28 17:58:20,247 INFO L280 TraceCheckUtils]: 13: Hoare triple {226#false} assume !(list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset); {226#false} is VALID [2020-07-28 17:58:20,247 INFO L280 TraceCheckUtils]: 14: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-28 17:58:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:20,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389250678] [2020-07-28 17:58:20,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:20,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 17:58:20,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329978581] [2020-07-28 17:58:20,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-28 17:58:20,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:20,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:58:20,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:20,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:58:20,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:58:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:58:20,282 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-07-28 17:58:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:20,506 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-28 17:58:20,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:58:20,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-28 17:58:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:58:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2020-07-28 17:58:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:58:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2020-07-28 17:58:20,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2020-07-28 17:58:20,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:20,588 INFO L225 Difference]: With dead ends: 52 [2020-07-28 17:58:20,589 INFO L226 Difference]: Without dead ends: 32 [2020-07-28 17:58:20,590 INFO L675 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 [2020-07-28 17:58:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-28 17:58:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-28 17:58:20,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:20,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-28 17:58:20,605 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-28 17:58:20,605 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-28 17:58:20,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:20,608 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-28 17:58:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-28 17:58:20,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:20,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:20,609 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-28 17:58:20,610 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-28 17:58:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:20,612 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-28 17:58:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-28 17:58:20,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:20,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:20,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:20,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-28 17:58:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-28 17:58:20,617 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2020-07-28 17:58:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:20,618 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-28 17:58:20,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:58:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-28 17:58:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:58:20,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:20,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:20,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:58:20,620 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:20,620 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2020-07-28 17:58:20,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:20,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615537817] [2020-07-28 17:58:20,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:20,903 INFO L280 TraceCheckUtils]: 0: Hoare triple {395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {397#(and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:20,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {397#(and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset))} havoc main_#res;havoc main_#t~ret32.base, main_#t~ret32.offset, main_#t~ret33.base, main_#t~ret33.offset, main_~dev1~0.base, main_~dev1~0.offset, main_~dev2~0.base, main_~dev2~0.offset;havoc main_~dev1~0.base, main_~dev1~0.offset;havoc main_~dev2~0.base, main_~dev2~0.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {397#(and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:20,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#(and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset))} assume __getMemory_~size > 0; {397#(and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:20,908 INFO L280 TraceCheckUtils]: 3: Hoare triple {397#(and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset))} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {398#(and (= 0 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:20,909 INFO L280 TraceCheckUtils]: 4: Hoare triple {398#(and (= 0 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset))} assume 0 == __getMemory_#t~nondet29;havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := 0, 0; {398#(and (= 0 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:20,910 INFO L280 TraceCheckUtils]: 5: Hoare triple {398#(and (= 0 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset))} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {398#(and (= 0 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:20,912 INFO L280 TraceCheckUtils]: 6: Hoare triple {398#(and (= 0 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset))} main_#t~ret32.base, main_#t~ret32.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev1~0.base, main_~dev1~0.offset := main_#t~ret32.base, main_#t~ret32.offset;havoc main_#t~ret32.base, main_#t~ret32.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {398#(and (= 0 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:20,913 INFO L280 TraceCheckUtils]: 7: Hoare triple {398#(and (= 0 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset))} assume __getMemory_~size > 0; {398#(and (= 0 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:20,915 INFO L280 TraceCheckUtils]: 8: Hoare triple {398#(and (= 0 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset))} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {399#(and (= 0 ~elem~0.offset) (<= 2 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:20,917 INFO L280 TraceCheckUtils]: 9: Hoare triple {399#(and (= 0 ~elem~0.offset) (<= 2 ~guard_malloc_counter~0.offset))} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {400#(and (= 0 ~elem~0.offset) (<= 2 |ULTIMATE.start___getMemory_#res.offset|))} is VALID [2020-07-28 17:58:20,918 INFO L280 TraceCheckUtils]: 10: Hoare triple {400#(and (= 0 ~elem~0.offset) (<= 2 |ULTIMATE.start___getMemory_#res.offset|))} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {401#(and (= 0 ~elem~0.offset) (<= 2 |ULTIMATE.start_my_malloc_#res.offset|))} is VALID [2020-07-28 17:58:20,920 INFO L280 TraceCheckUtils]: 11: Hoare triple {401#(and (= 0 ~elem~0.offset) (<= 2 |ULTIMATE.start_my_malloc_#res.offset|))} main_#t~ret33.base, main_#t~ret33.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev2~0.base, main_~dev2~0.offset := main_#t~ret33.base, main_#t~ret33.offset;havoc main_#t~ret33.base, main_#t~ret33.offset; {402#(and (= 0 ~elem~0.offset) (not (= 0 ULTIMATE.start_main_~dev2~0.offset)))} is VALID [2020-07-28 17:58:20,925 INFO L280 TraceCheckUtils]: 12: Hoare triple {402#(and (= 0 ~elem~0.offset) (not (= 0 ULTIMATE.start_main_~dev2~0.offset)))} assume (main_~dev1~0.base != 0 || main_~dev1~0.offset != 0) && (main_~dev2~0.base != 0 || main_~dev2~0.offset != 0);list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {403#(not (= ULTIMATE.start_list_add_~new.offset ~elem~0.offset))} is VALID [2020-07-28 17:58:20,926 INFO L280 TraceCheckUtils]: 13: Hoare triple {403#(not (= ULTIMATE.start_list_add_~new.offset ~elem~0.offset))} assume !(list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset); {396#false} is VALID [2020-07-28 17:58:20,927 INFO L280 TraceCheckUtils]: 14: Hoare triple {396#false} assume !false; {396#false} is VALID [2020-07-28 17:58:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:20,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615537817] [2020-07-28 17:58:20,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:20,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-28 17:58:20,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218854596] [2020-07-28 17:58:20,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-07-28 17:58:20,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:20,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 17:58:20,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:20,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 17:58:20,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:20,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 17:58:20,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-28 17:58:20,966 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2020-07-28 17:58:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:21,545 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-28 17:58:21,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 17:58:21,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-07-28 17:58:21,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:58:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2020-07-28 17:58:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:58:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2020-07-28 17:58:21,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2020-07-28 17:58:21,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:21,634 INFO L225 Difference]: With dead ends: 42 [2020-07-28 17:58:21,634 INFO L226 Difference]: Without dead ends: 34 [2020-07-28 17:58:21,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-28 17:58:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-28 17:58:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-28 17:58:21,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:21,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-28 17:58:21,660 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-28 17:58:21,660 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-28 17:58:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:21,662 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-28 17:58:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-28 17:58:21,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:21,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:21,663 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-28 17:58:21,663 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-28 17:58:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:21,665 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-28 17:58:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-28 17:58:21,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:21,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:21,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:21,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-28 17:58:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-28 17:58:21,669 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 15 [2020-07-28 17:58:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:21,670 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-28 17:58:21,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 17:58:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-28 17:58:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 17:58:21,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:21,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:21,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:58:21,675 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:21,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:21,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1186712674, now seen corresponding path program 1 times [2020-07-28 17:58:21,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:21,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924544703] [2020-07-28 17:58:21,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:21,834 INFO L280 TraceCheckUtils]: 0: Hoare triple {564#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {564#true} is VALID [2020-07-28 17:58:21,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {564#true} havoc main_#res;havoc main_#t~ret32.base, main_#t~ret32.offset, main_#t~ret33.base, main_#t~ret33.offset, main_~dev1~0.base, main_~dev1~0.offset, main_~dev2~0.base, main_~dev2~0.offset;havoc main_~dev1~0.base, main_~dev1~0.offset;havoc main_~dev2~0.base, main_~dev2~0.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {564#true} is VALID [2020-07-28 17:58:21,835 INFO L280 TraceCheckUtils]: 2: Hoare triple {564#true} assume __getMemory_~size > 0; {564#true} is VALID [2020-07-28 17:58:21,836 INFO L280 TraceCheckUtils]: 3: Hoare triple {564#true} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {564#true} is VALID [2020-07-28 17:58:21,837 INFO L280 TraceCheckUtils]: 4: Hoare triple {564#true} assume 0 == __getMemory_#t~nondet29;havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := 0, 0; {566#(and (= 0 |ULTIMATE.start___getMemory_#res.base|) (= 0 |ULTIMATE.start___getMemory_#res.offset|))} is VALID [2020-07-28 17:58:21,838 INFO L280 TraceCheckUtils]: 5: Hoare triple {566#(and (= 0 |ULTIMATE.start___getMemory_#res.base|) (= 0 |ULTIMATE.start___getMemory_#res.offset|))} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {567#(and (= 0 |ULTIMATE.start_my_malloc_#res.base|) (= 0 |ULTIMATE.start_my_malloc_#res.offset|))} is VALID [2020-07-28 17:58:21,838 INFO L280 TraceCheckUtils]: 6: Hoare triple {567#(and (= 0 |ULTIMATE.start_my_malloc_#res.base|) (= 0 |ULTIMATE.start_my_malloc_#res.offset|))} main_#t~ret32.base, main_#t~ret32.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev1~0.base, main_~dev1~0.offset := main_#t~ret32.base, main_#t~ret32.offset;havoc main_#t~ret32.base, main_#t~ret32.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {568#(and (= 0 ULTIMATE.start_main_~dev1~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base))} is VALID [2020-07-28 17:58:21,839 INFO L280 TraceCheckUtils]: 7: Hoare triple {568#(and (= 0 ULTIMATE.start_main_~dev1~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base))} assume __getMemory_~size > 0; {568#(and (= 0 ULTIMATE.start_main_~dev1~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base))} is VALID [2020-07-28 17:58:21,841 INFO L280 TraceCheckUtils]: 8: Hoare triple {568#(and (= 0 ULTIMATE.start_main_~dev1~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base))} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {568#(and (= 0 ULTIMATE.start_main_~dev1~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base))} is VALID [2020-07-28 17:58:21,842 INFO L280 TraceCheckUtils]: 9: Hoare triple {568#(and (= 0 ULTIMATE.start_main_~dev1~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base))} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {568#(and (= 0 ULTIMATE.start_main_~dev1~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base))} is VALID [2020-07-28 17:58:21,843 INFO L280 TraceCheckUtils]: 10: Hoare triple {568#(and (= 0 ULTIMATE.start_main_~dev1~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base))} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {568#(and (= 0 ULTIMATE.start_main_~dev1~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base))} is VALID [2020-07-28 17:58:21,844 INFO L280 TraceCheckUtils]: 11: Hoare triple {568#(and (= 0 ULTIMATE.start_main_~dev1~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base))} main_#t~ret33.base, main_#t~ret33.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev2~0.base, main_~dev2~0.offset := main_#t~ret33.base, main_#t~ret33.offset;havoc main_#t~ret33.base, main_#t~ret33.offset; {568#(and (= 0 ULTIMATE.start_main_~dev1~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base))} is VALID [2020-07-28 17:58:21,845 INFO L280 TraceCheckUtils]: 12: Hoare triple {568#(and (= 0 ULTIMATE.start_main_~dev1~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base))} assume (main_~dev1~0.base != 0 || main_~dev1~0.offset != 0) && (main_~dev2~0.base != 0 || main_~dev2~0.offset != 0);list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {565#false} is VALID [2020-07-28 17:58:21,846 INFO L280 TraceCheckUtils]: 13: Hoare triple {565#false} assume list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset; {565#false} is VALID [2020-07-28 17:58:21,846 INFO L280 TraceCheckUtils]: 14: Hoare triple {565#false} assume -2147483648 <= list_add_#t~nondet31 && list_add_#t~nondet31 <= 2147483647; {565#false} is VALID [2020-07-28 17:58:21,846 INFO L280 TraceCheckUtils]: 15: Hoare triple {565#false} assume 0 != list_add_#t~nondet31;havoc list_add_#t~nondet31;~elem~0.base, ~elem~0.offset := list_add_~new.base, list_add_~new.offset; {565#false} is VALID [2020-07-28 17:58:21,847 INFO L280 TraceCheckUtils]: 16: Hoare triple {565#false} list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev1~0.base, main_~dev1~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {565#false} is VALID [2020-07-28 17:58:21,847 INFO L280 TraceCheckUtils]: 17: Hoare triple {565#false} assume !(list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset); {565#false} is VALID [2020-07-28 17:58:21,847 INFO L280 TraceCheckUtils]: 18: Hoare triple {565#false} assume !false; {565#false} is VALID [2020-07-28 17:58:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:21,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924544703] [2020-07-28 17:58:21,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:21,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 17:58:21,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583302551] [2020-07-28 17:58:21,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-28 17:58:21,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:21,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:58:21,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:21,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:58:21,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:58:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:58:21,884 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2020-07-28 17:58:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:22,091 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2020-07-28 17:58:22,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:58:22,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-28 17:58:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:58:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2020-07-28 17:58:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:58:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2020-07-28 17:58:22,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2020-07-28 17:58:22,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:22,156 INFO L225 Difference]: With dead ends: 59 [2020-07-28 17:58:22,156 INFO L226 Difference]: Without dead ends: 32 [2020-07-28 17:58:22,157 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:58:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-28 17:58:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-28 17:58:22,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:22,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-28 17:58:22,178 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-28 17:58:22,178 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-28 17:58:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:22,179 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-28 17:58:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-28 17:58:22,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:22,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:22,180 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-28 17:58:22,180 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-28 17:58:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:22,181 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-28 17:58:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-28 17:58:22,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:22,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:22,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:22,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-28 17:58:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-28 17:58:22,184 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 19 [2020-07-28 17:58:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:22,184 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-28 17:58:22,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:58:22,184 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-28 17:58:22,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 17:58:22,185 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:22,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:22,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 17:58:22,186 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:22,186 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2020-07-28 17:58:22,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:22,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127120684] [2020-07-28 17:58:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:22,385 INFO L280 TraceCheckUtils]: 0: Hoare triple {740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {740#true} is VALID [2020-07-28 17:58:22,386 INFO L280 TraceCheckUtils]: 1: Hoare triple {740#true} havoc main_#res;havoc main_#t~ret32.base, main_#t~ret32.offset, main_#t~ret33.base, main_#t~ret33.offset, main_~dev1~0.base, main_~dev1~0.offset, main_~dev2~0.base, main_~dev2~0.offset;havoc main_~dev1~0.base, main_~dev1~0.offset;havoc main_~dev2~0.base, main_~dev2~0.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {740#true} is VALID [2020-07-28 17:58:22,386 INFO L280 TraceCheckUtils]: 2: Hoare triple {740#true} assume __getMemory_~size > 0; {740#true} is VALID [2020-07-28 17:58:22,387 INFO L280 TraceCheckUtils]: 3: Hoare triple {740#true} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {740#true} is VALID [2020-07-28 17:58:22,392 INFO L280 TraceCheckUtils]: 4: Hoare triple {740#true} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {742#(<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:22,393 INFO L280 TraceCheckUtils]: 5: Hoare triple {742#(<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset)} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {743#(<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:22,394 INFO L280 TraceCheckUtils]: 6: Hoare triple {743#(<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset)} main_#t~ret32.base, main_#t~ret32.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev1~0.base, main_~dev1~0.offset := main_#t~ret32.base, main_#t~ret32.offset;havoc main_#t~ret32.base, main_#t~ret32.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {744#(<= ULTIMATE.start_main_~dev1~0.offset ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:22,395 INFO L280 TraceCheckUtils]: 7: Hoare triple {744#(<= ULTIMATE.start_main_~dev1~0.offset ~guard_malloc_counter~0.offset)} assume __getMemory_~size > 0; {744#(<= ULTIMATE.start_main_~dev1~0.offset ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:22,397 INFO L280 TraceCheckUtils]: 8: Hoare triple {744#(<= ULTIMATE.start_main_~dev1~0.offset ~guard_malloc_counter~0.offset)} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {745#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:22,398 INFO L280 TraceCheckUtils]: 9: Hoare triple {745#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) ~guard_malloc_counter~0.offset)} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {746#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start___getMemory_#res.offset|)} is VALID [2020-07-28 17:58:22,398 INFO L280 TraceCheckUtils]: 10: Hoare triple {746#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start___getMemory_#res.offset|)} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {747#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start_my_malloc_#res.offset|)} is VALID [2020-07-28 17:58:22,399 INFO L280 TraceCheckUtils]: 11: Hoare triple {747#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start_my_malloc_#res.offset|)} main_#t~ret33.base, main_#t~ret33.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev2~0.base, main_~dev2~0.offset := main_#t~ret33.base, main_#t~ret33.offset;havoc main_#t~ret33.base, main_#t~ret33.offset; {748#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) ULTIMATE.start_main_~dev2~0.offset)} is VALID [2020-07-28 17:58:22,400 INFO L280 TraceCheckUtils]: 12: Hoare triple {748#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) ULTIMATE.start_main_~dev2~0.offset)} assume (main_~dev1~0.base != 0 || main_~dev1~0.offset != 0) && (main_~dev2~0.base != 0 || main_~dev2~0.offset != 0);list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {749#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) ULTIMATE.start_list_add_~new.offset)} is VALID [2020-07-28 17:58:22,400 INFO L280 TraceCheckUtils]: 13: Hoare triple {749#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) ULTIMATE.start_list_add_~new.offset)} assume list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset; {749#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) ULTIMATE.start_list_add_~new.offset)} is VALID [2020-07-28 17:58:22,401 INFO L280 TraceCheckUtils]: 14: Hoare triple {749#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) ULTIMATE.start_list_add_~new.offset)} assume -2147483648 <= list_add_#t~nondet31 && list_add_#t~nondet31 <= 2147483647; {749#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) ULTIMATE.start_list_add_~new.offset)} is VALID [2020-07-28 17:58:22,402 INFO L280 TraceCheckUtils]: 15: Hoare triple {749#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) ULTIMATE.start_list_add_~new.offset)} assume 0 != list_add_#t~nondet31;havoc list_add_#t~nondet31;~elem~0.base, ~elem~0.offset := list_add_~new.base, list_add_~new.offset; {750#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) ~elem~0.offset)} is VALID [2020-07-28 17:58:22,403 INFO L280 TraceCheckUtils]: 16: Hoare triple {750#(<= (+ ULTIMATE.start_main_~dev1~0.offset 1) ~elem~0.offset)} list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev1~0.base, main_~dev1~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {751#(not (= ULTIMATE.start_list_add_~new.offset ~elem~0.offset))} is VALID [2020-07-28 17:58:22,404 INFO L280 TraceCheckUtils]: 17: Hoare triple {751#(not (= ULTIMATE.start_list_add_~new.offset ~elem~0.offset))} assume !(list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset); {741#false} is VALID [2020-07-28 17:58:22,405 INFO L280 TraceCheckUtils]: 18: Hoare triple {741#false} assume !false; {741#false} is VALID [2020-07-28 17:58:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:22,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127120684] [2020-07-28 17:58:22,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:22,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-28 17:58:22,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856670645] [2020-07-28 17:58:22,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-07-28 17:58:22,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:22,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-28 17:58:22,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:22,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-28 17:58:22,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:22,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-28 17:58:22,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-07-28 17:58:22,451 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 12 states. [2020-07-28 17:58:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:23,223 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-28 17:58:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-28 17:58:23,224 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-07-28 17:58:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 17:58:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2020-07-28 17:58:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 17:58:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2020-07-28 17:58:23,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2020-07-28 17:58:23,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:23,301 INFO L225 Difference]: With dead ends: 38 [2020-07-28 17:58:23,301 INFO L226 Difference]: Without dead ends: 36 [2020-07-28 17:58:23,302 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-28 17:58:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-28 17:58:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2020-07-28 17:58:23,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:23,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 32 states. [2020-07-28 17:58:23,318 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 32 states. [2020-07-28 17:58:23,318 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 32 states. [2020-07-28 17:58:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:23,320 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-28 17:58:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-28 17:58:23,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:23,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:23,321 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 36 states. [2020-07-28 17:58:23,321 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 36 states. [2020-07-28 17:58:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:23,323 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-28 17:58:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-28 17:58:23,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:23,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:23,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:23,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-28 17:58:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-28 17:58:23,325 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 19 [2020-07-28 17:58:23,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:23,326 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-28 17:58:23,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-28 17:58:23,326 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-28 17:58:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 17:58:23,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:23,327 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:23,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 17:58:23,327 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:23,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:23,327 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2020-07-28 17:58:23,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:23,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860295247] [2020-07-28 17:58:23,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:23,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {920#(and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:23,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {920#(and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset))} havoc main_#res;havoc main_#t~ret32.base, main_#t~ret32.offset, main_#t~ret33.base, main_#t~ret33.offset, main_~dev1~0.base, main_~dev1~0.offset, main_~dev2~0.base, main_~dev2~0.offset;havoc main_~dev1~0.base, main_~dev1~0.offset;havoc main_~dev2~0.base, main_~dev2~0.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {920#(and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:23,525 INFO L280 TraceCheckUtils]: 2: Hoare triple {920#(and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset))} assume __getMemory_~size > 0; {920#(and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:23,527 INFO L280 TraceCheckUtils]: 3: Hoare triple {920#(and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset))} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {921#(and (= 0 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset))} is VALID [2020-07-28 17:58:23,528 INFO L280 TraceCheckUtils]: 4: Hoare triple {921#(and (= 0 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset))} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {922#(and (= 0 ~elem~0.offset) (<= 1 |ULTIMATE.start___getMemory_#res.offset|))} is VALID [2020-07-28 17:58:23,529 INFO L280 TraceCheckUtils]: 5: Hoare triple {922#(and (= 0 ~elem~0.offset) (<= 1 |ULTIMATE.start___getMemory_#res.offset|))} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {923#(and (<= 1 |ULTIMATE.start_my_malloc_#res.offset|) (= 0 ~elem~0.offset))} is VALID [2020-07-28 17:58:23,530 INFO L280 TraceCheckUtils]: 6: Hoare triple {923#(and (<= 1 |ULTIMATE.start_my_malloc_#res.offset|) (= 0 ~elem~0.offset))} main_#t~ret32.base, main_#t~ret32.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev1~0.base, main_~dev1~0.offset := main_#t~ret32.base, main_#t~ret32.offset;havoc main_#t~ret32.base, main_#t~ret32.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} is VALID [2020-07-28 17:58:23,531 INFO L280 TraceCheckUtils]: 7: Hoare triple {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} assume __getMemory_~size > 0; {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} is VALID [2020-07-28 17:58:23,532 INFO L280 TraceCheckUtils]: 8: Hoare triple {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} is VALID [2020-07-28 17:58:23,533 INFO L280 TraceCheckUtils]: 9: Hoare triple {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} is VALID [2020-07-28 17:58:23,534 INFO L280 TraceCheckUtils]: 10: Hoare triple {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} is VALID [2020-07-28 17:58:23,535 INFO L280 TraceCheckUtils]: 11: Hoare triple {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} main_#t~ret33.base, main_#t~ret33.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev2~0.base, main_~dev2~0.offset := main_#t~ret33.base, main_#t~ret33.offset;havoc main_#t~ret33.base, main_#t~ret33.offset; {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} is VALID [2020-07-28 17:58:23,536 INFO L280 TraceCheckUtils]: 12: Hoare triple {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} assume (main_~dev1~0.base != 0 || main_~dev1~0.offset != 0) && (main_~dev2~0.base != 0 || main_~dev2~0.offset != 0);list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} is VALID [2020-07-28 17:58:23,537 INFO L280 TraceCheckUtils]: 13: Hoare triple {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} assume list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset; {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} is VALID [2020-07-28 17:58:23,539 INFO L280 TraceCheckUtils]: 14: Hoare triple {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} assume -2147483648 <= list_add_#t~nondet31 && list_add_#t~nondet31 <= 2147483647; {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} is VALID [2020-07-28 17:58:23,540 INFO L280 TraceCheckUtils]: 15: Hoare triple {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} assume !(0 != list_add_#t~nondet31);havoc list_add_#t~nondet31; {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} is VALID [2020-07-28 17:58:23,541 INFO L280 TraceCheckUtils]: 16: Hoare triple {924#(and (= 0 ~elem~0.offset) (<= 1 ULTIMATE.start_main_~dev1~0.offset))} list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev1~0.base, main_~dev1~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {925#(and (= 0 ~elem~0.offset) (not (= 0 ULTIMATE.start_list_add_~new.offset)))} is VALID [2020-07-28 17:58:23,542 INFO L280 TraceCheckUtils]: 17: Hoare triple {925#(and (= 0 ~elem~0.offset) (not (= 0 ULTIMATE.start_list_add_~new.offset)))} assume !(list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset); {919#false} is VALID [2020-07-28 17:58:23,542 INFO L280 TraceCheckUtils]: 18: Hoare triple {919#false} assume !false; {919#false} is VALID [2020-07-28 17:58:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:23,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860295247] [2020-07-28 17:58:23,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:23,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-28 17:58:23,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947431100] [2020-07-28 17:58:23,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-28 17:58:23,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:23,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 17:58:23,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:23,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 17:58:23,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:23,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 17:58:23,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:58:23,571 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2020-07-28 17:58:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:24,013 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-28 17:58:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 17:58:24,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-07-28 17:58:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:58:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2020-07-28 17:58:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:58:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2020-07-28 17:58:24,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 34 transitions. [2020-07-28 17:58:24,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:24,063 INFO L225 Difference]: With dead ends: 32 [2020-07-28 17:58:24,063 INFO L226 Difference]: Without dead ends: 30 [2020-07-28 17:58:24,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-07-28 17:58:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-28 17:58:24,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-28 17:58:24,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:24,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:24,084 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:24,085 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:24,086 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-28 17:58:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-28 17:58:24,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:24,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:24,087 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:24,087 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:24,088 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-28 17:58:24,088 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-28 17:58:24,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:24,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:24,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:24,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-28 17:58:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-28 17:58:24,091 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 19 [2020-07-28 17:58:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:24,091 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-28 17:58:24,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 17:58:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-28 17:58:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-28 17:58:24,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:24,092 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:24,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 17:58:24,092 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:24,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:24,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2020-07-28 17:58:24,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:24,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283066402] [2020-07-28 17:58:24,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:24,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {1070#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {1072#(= 0 ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:24,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {1072#(= 0 ~guard_malloc_counter~0.offset)} havoc main_#res;havoc main_#t~ret32.base, main_#t~ret32.offset, main_#t~ret33.base, main_#t~ret33.offset, main_~dev1~0.base, main_~dev1~0.offset, main_~dev2~0.base, main_~dev2~0.offset;havoc main_~dev1~0.base, main_~dev1~0.offset;havoc main_~dev2~0.base, main_~dev2~0.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {1072#(= 0 ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:24,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {1072#(= 0 ~guard_malloc_counter~0.offset)} assume __getMemory_~size > 0; {1072#(= 0 ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:24,315 INFO L280 TraceCheckUtils]: 3: Hoare triple {1072#(= 0 ~guard_malloc_counter~0.offset)} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {1073#(<= 1 ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:24,316 INFO L280 TraceCheckUtils]: 4: Hoare triple {1073#(<= 1 ~guard_malloc_counter~0.offset)} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1073#(<= 1 ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:24,317 INFO L280 TraceCheckUtils]: 5: Hoare triple {1073#(<= 1 ~guard_malloc_counter~0.offset)} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {1073#(<= 1 ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:24,317 INFO L280 TraceCheckUtils]: 6: Hoare triple {1073#(<= 1 ~guard_malloc_counter~0.offset)} main_#t~ret32.base, main_#t~ret32.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev1~0.base, main_~dev1~0.offset := main_#t~ret32.base, main_#t~ret32.offset;havoc main_#t~ret32.base, main_#t~ret32.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {1073#(<= 1 ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:24,318 INFO L280 TraceCheckUtils]: 7: Hoare triple {1073#(<= 1 ~guard_malloc_counter~0.offset)} assume __getMemory_~size > 0; {1073#(<= 1 ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:24,319 INFO L280 TraceCheckUtils]: 8: Hoare triple {1073#(<= 1 ~guard_malloc_counter~0.offset)} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {1074#(<= 2 ~guard_malloc_counter~0.offset)} is VALID [2020-07-28 17:58:24,320 INFO L280 TraceCheckUtils]: 9: Hoare triple {1074#(<= 2 ~guard_malloc_counter~0.offset)} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1075#(<= 2 |ULTIMATE.start___getMemory_#res.offset|)} is VALID [2020-07-28 17:58:24,321 INFO L280 TraceCheckUtils]: 10: Hoare triple {1075#(<= 2 |ULTIMATE.start___getMemory_#res.offset|)} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {1076#(<= 2 |ULTIMATE.start_my_malloc_#res.offset|)} is VALID [2020-07-28 17:58:24,321 INFO L280 TraceCheckUtils]: 11: Hoare triple {1076#(<= 2 |ULTIMATE.start_my_malloc_#res.offset|)} main_#t~ret33.base, main_#t~ret33.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev2~0.base, main_~dev2~0.offset := main_#t~ret33.base, main_#t~ret33.offset;havoc main_#t~ret33.base, main_#t~ret33.offset; {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:24,322 INFO L280 TraceCheckUtils]: 12: Hoare triple {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} assume (main_~dev1~0.base != 0 || main_~dev1~0.offset != 0) && (main_~dev2~0.base != 0 || main_~dev2~0.offset != 0);list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:24,323 INFO L280 TraceCheckUtils]: 13: Hoare triple {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} assume list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset; {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:24,323 INFO L280 TraceCheckUtils]: 14: Hoare triple {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} assume -2147483648 <= list_add_#t~nondet31 && list_add_#t~nondet31 <= 2147483647; {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:24,324 INFO L280 TraceCheckUtils]: 15: Hoare triple {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} assume 0 != list_add_#t~nondet31;havoc list_add_#t~nondet31;~elem~0.base, ~elem~0.offset := list_add_~new.base, list_add_~new.offset; {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:24,325 INFO L280 TraceCheckUtils]: 16: Hoare triple {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev1~0.base, main_~dev1~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:24,326 INFO L280 TraceCheckUtils]: 17: Hoare triple {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} assume list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset; {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:24,326 INFO L280 TraceCheckUtils]: 18: Hoare triple {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} assume -2147483648 <= list_add_#t~nondet31 && list_add_#t~nondet31 <= 2147483647; {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:24,327 INFO L280 TraceCheckUtils]: 19: Hoare triple {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} assume 0 != list_add_#t~nondet31;havoc list_add_#t~nondet31;~elem~0.base, ~elem~0.offset := list_add_~new.base, list_add_~new.offset; {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:24,328 INFO L280 TraceCheckUtils]: 20: Hoare triple {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} list_del_#in~entry.base, list_del_#in~entry.offset := main_~dev2~0.base, main_~dev2~0.offset;havoc list_del_~entry.base, list_del_~entry.offset;list_del_~entry.base, list_del_~entry.offset := list_del_#in~entry.base, list_del_#in~entry.offset; {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:24,329 INFO L280 TraceCheckUtils]: 21: Hoare triple {1077#(not (= 0 ULTIMATE.start_main_~dev2~0.offset))} assume list_del_~entry.base == ~elem~0.base && list_del_~entry.offset == ~elem~0.offset;~elem~0.base, ~elem~0.offset := 0, 0; {1078#(and (= 0 ~elem~0.offset) (not (= 0 ULTIMATE.start_main_~dev2~0.offset)))} is VALID [2020-07-28 17:58:24,330 INFO L280 TraceCheckUtils]: 22: Hoare triple {1078#(and (= 0 ~elem~0.offset) (not (= 0 ULTIMATE.start_main_~dev2~0.offset)))} list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {1079#(not (= ULTIMATE.start_list_add_~new.offset ~elem~0.offset))} is VALID [2020-07-28 17:58:24,331 INFO L280 TraceCheckUtils]: 23: Hoare triple {1079#(not (= ULTIMATE.start_list_add_~new.offset ~elem~0.offset))} assume !(list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset); {1071#false} is VALID [2020-07-28 17:58:24,331 INFO L280 TraceCheckUtils]: 24: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2020-07-28 17:58:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:24,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283066402] [2020-07-28 17:58:24,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:24,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-28 17:58:24,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207670019] [2020-07-28 17:58:24,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-07-28 17:58:24,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:24,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 17:58:24,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:24,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 17:58:24,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:24,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 17:58:24,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-28 17:58:24,364 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 10 states. [2020-07-28 17:58:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:24,758 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-28 17:58:24,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 17:58:24,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-07-28 17:58:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:58:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-28 17:58:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:58:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-28 17:58:24,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 31 transitions. [2020-07-28 17:58:24,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:24,803 INFO L225 Difference]: With dead ends: 34 [2020-07-28 17:58:24,803 INFO L226 Difference]: Without dead ends: 30 [2020-07-28 17:58:24,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2020-07-28 17:58:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-28 17:58:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-28 17:58:24,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:24,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:24,828 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:24,828 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:24,830 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-28 17:58:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-28 17:58:24,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:24,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:24,831 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:24,831 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-28 17:58:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:24,833 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-28 17:58:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-28 17:58:24,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:24,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:24,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:24,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-28 17:58:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-28 17:58:24,836 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2020-07-28 17:58:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:24,837 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-28 17:58:24,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 17:58:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-28 17:58:24,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-28 17:58:24,838 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:24,838 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:24,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-28 17:58:24,839 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:24,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:24,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2020-07-28 17:58:24,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:24,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370083658] [2020-07-28 17:58:24,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:25,036 INFO L280 TraceCheckUtils]: 0: Hoare triple {1224#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {1224#true} is VALID [2020-07-28 17:58:25,036 INFO L280 TraceCheckUtils]: 1: Hoare triple {1224#true} havoc main_#res;havoc main_#t~ret32.base, main_#t~ret32.offset, main_#t~ret33.base, main_#t~ret33.offset, main_~dev1~0.base, main_~dev1~0.offset, main_~dev2~0.base, main_~dev2~0.offset;havoc main_~dev1~0.base, main_~dev1~0.offset;havoc main_~dev2~0.base, main_~dev2~0.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {1224#true} is VALID [2020-07-28 17:58:25,036 INFO L280 TraceCheckUtils]: 2: Hoare triple {1224#true} assume __getMemory_~size > 0; {1224#true} is VALID [2020-07-28 17:58:25,037 INFO L280 TraceCheckUtils]: 3: Hoare triple {1224#true} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {1224#true} is VALID [2020-07-28 17:58:25,037 INFO L280 TraceCheckUtils]: 4: Hoare triple {1224#true} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1224#true} is VALID [2020-07-28 17:58:25,037 INFO L280 TraceCheckUtils]: 5: Hoare triple {1224#true} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {1224#true} is VALID [2020-07-28 17:58:25,037 INFO L280 TraceCheckUtils]: 6: Hoare triple {1224#true} main_#t~ret32.base, main_#t~ret32.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev1~0.base, main_~dev1~0.offset := main_#t~ret32.base, main_#t~ret32.offset;havoc main_#t~ret32.base, main_#t~ret32.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {1224#true} is VALID [2020-07-28 17:58:25,037 INFO L280 TraceCheckUtils]: 7: Hoare triple {1224#true} assume __getMemory_~size > 0; {1224#true} is VALID [2020-07-28 17:58:25,038 INFO L280 TraceCheckUtils]: 8: Hoare triple {1224#true} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {1224#true} is VALID [2020-07-28 17:58:25,038 INFO L280 TraceCheckUtils]: 9: Hoare triple {1224#true} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1224#true} is VALID [2020-07-28 17:58:25,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {1224#true} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {1224#true} is VALID [2020-07-28 17:58:25,038 INFO L280 TraceCheckUtils]: 11: Hoare triple {1224#true} main_#t~ret33.base, main_#t~ret33.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev2~0.base, main_~dev2~0.offset := main_#t~ret33.base, main_#t~ret33.offset;havoc main_#t~ret33.base, main_#t~ret33.offset; {1224#true} is VALID [2020-07-28 17:58:25,040 INFO L280 TraceCheckUtils]: 12: Hoare triple {1224#true} assume (main_~dev1~0.base != 0 || main_~dev1~0.offset != 0) && (main_~dev2~0.base != 0 || main_~dev2~0.offset != 0);list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {1226#(and (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base) (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:25,041 INFO L280 TraceCheckUtils]: 13: Hoare triple {1226#(and (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base) (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset))} assume list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset; {1226#(and (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base) (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:25,041 INFO L280 TraceCheckUtils]: 14: Hoare triple {1226#(and (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base) (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset))} assume -2147483648 <= list_add_#t~nondet31 && list_add_#t~nondet31 <= 2147483647; {1226#(and (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base) (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:25,043 INFO L280 TraceCheckUtils]: 15: Hoare triple {1226#(and (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base) (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset))} assume 0 != list_add_#t~nondet31;havoc list_add_#t~nondet31;~elem~0.base, ~elem~0.offset := list_add_~new.base, list_add_~new.offset; {1227#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} is VALID [2020-07-28 17:58:25,044 INFO L280 TraceCheckUtils]: 16: Hoare triple {1227#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev1~0.base, main_~dev1~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {1227#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} is VALID [2020-07-28 17:58:25,045 INFO L280 TraceCheckUtils]: 17: Hoare triple {1227#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} assume list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset; {1228#(or (not (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset)) (not (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base)))} is VALID [2020-07-28 17:58:25,046 INFO L280 TraceCheckUtils]: 18: Hoare triple {1228#(or (not (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset)) (not (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base)))} assume -2147483648 <= list_add_#t~nondet31 && list_add_#t~nondet31 <= 2147483647; {1228#(or (not (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset)) (not (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base)))} is VALID [2020-07-28 17:58:25,047 INFO L280 TraceCheckUtils]: 19: Hoare triple {1228#(or (not (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset)) (not (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base)))} assume 0 != list_add_#t~nondet31;havoc list_add_#t~nondet31;~elem~0.base, ~elem~0.offset := list_add_~new.base, list_add_~new.offset; {1229#(or (not (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base)) (not (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset)))} is VALID [2020-07-28 17:58:25,048 INFO L280 TraceCheckUtils]: 20: Hoare triple {1229#(or (not (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base)) (not (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset)))} list_del_#in~entry.base, list_del_#in~entry.offset := main_~dev2~0.base, main_~dev2~0.offset;havoc list_del_~entry.base, list_del_~entry.offset;list_del_~entry.base, list_del_~entry.offset := list_del_#in~entry.base, list_del_#in~entry.offset; {1229#(or (not (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base)) (not (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset)))} is VALID [2020-07-28 17:58:25,049 INFO L280 TraceCheckUtils]: 21: Hoare triple {1229#(or (not (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base)) (not (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset)))} assume !(list_del_~entry.base == ~elem~0.base && list_del_~entry.offset == ~elem~0.offset); {1229#(or (not (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base)) (not (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset)))} is VALID [2020-07-28 17:58:25,051 INFO L280 TraceCheckUtils]: 22: Hoare triple {1229#(or (not (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base)) (not (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset)))} list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {1230#(or (not (= ~elem~0.base ULTIMATE.start_list_add_~new.base)) (not (= ULTIMATE.start_list_add_~new.offset ~elem~0.offset)))} is VALID [2020-07-28 17:58:25,052 INFO L280 TraceCheckUtils]: 23: Hoare triple {1230#(or (not (= ~elem~0.base ULTIMATE.start_list_add_~new.base)) (not (= ULTIMATE.start_list_add_~new.offset ~elem~0.offset)))} assume !(list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset); {1225#false} is VALID [2020-07-28 17:58:25,052 INFO L280 TraceCheckUtils]: 24: Hoare triple {1225#false} assume !false; {1225#false} is VALID [2020-07-28 17:58:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:25,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370083658] [2020-07-28 17:58:25,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:25,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-28 17:58:25,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052528664] [2020-07-28 17:58:25,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-28 17:58:25,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:25,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 17:58:25,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:25,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 17:58:25,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:25,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 17:58:25,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:58:25,088 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2020-07-28 17:58:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:25,465 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2020-07-28 17:58:25,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 17:58:25,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-28 17:58:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 17:58:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2020-07-28 17:58:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 17:58:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2020-07-28 17:58:25,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2020-07-28 17:58:25,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:25,524 INFO L225 Difference]: With dead ends: 40 [2020-07-28 17:58:25,524 INFO L226 Difference]: Without dead ends: 34 [2020-07-28 17:58:25,525 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-28 17:58:25,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-28 17:58:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2020-07-28 17:58:25,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:25,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 30 states. [2020-07-28 17:58:25,548 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 30 states. [2020-07-28 17:58:25,548 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 30 states. [2020-07-28 17:58:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:25,549 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-28 17:58:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-28 17:58:25,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:25,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:25,550 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 34 states. [2020-07-28 17:58:25,550 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 34 states. [2020-07-28 17:58:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:25,554 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-28 17:58:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-28 17:58:25,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:25,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:25,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:25,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-28 17:58:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2020-07-28 17:58:25,556 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2020-07-28 17:58:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:25,557 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2020-07-28 17:58:25,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 17:58:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2020-07-28 17:58:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-28 17:58:25,558 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:25,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:25,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-28 17:58:25,559 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2020-07-28 17:58:25,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:25,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477134220] [2020-07-28 17:58:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:25,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {1389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {1389#true} is VALID [2020-07-28 17:58:25,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {1389#true} havoc main_#res;havoc main_#t~ret32.base, main_#t~ret32.offset, main_#t~ret33.base, main_#t~ret33.offset, main_~dev1~0.base, main_~dev1~0.offset, main_~dev2~0.base, main_~dev2~0.offset;havoc main_~dev1~0.base, main_~dev1~0.offset;havoc main_~dev2~0.base, main_~dev2~0.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {1389#true} is VALID [2020-07-28 17:58:25,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {1389#true} assume __getMemory_~size > 0; {1389#true} is VALID [2020-07-28 17:58:25,642 INFO L280 TraceCheckUtils]: 3: Hoare triple {1389#true} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {1389#true} is VALID [2020-07-28 17:58:25,642 INFO L280 TraceCheckUtils]: 4: Hoare triple {1389#true} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1389#true} is VALID [2020-07-28 17:58:25,642 INFO L280 TraceCheckUtils]: 5: Hoare triple {1389#true} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {1389#true} is VALID [2020-07-28 17:58:25,643 INFO L280 TraceCheckUtils]: 6: Hoare triple {1389#true} main_#t~ret32.base, main_#t~ret32.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev1~0.base, main_~dev1~0.offset := main_#t~ret32.base, main_#t~ret32.offset;havoc main_#t~ret32.base, main_#t~ret32.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {1389#true} is VALID [2020-07-28 17:58:25,643 INFO L280 TraceCheckUtils]: 7: Hoare triple {1389#true} assume __getMemory_~size > 0; {1389#true} is VALID [2020-07-28 17:58:25,643 INFO L280 TraceCheckUtils]: 8: Hoare triple {1389#true} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {1389#true} is VALID [2020-07-28 17:58:25,643 INFO L280 TraceCheckUtils]: 9: Hoare triple {1389#true} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1389#true} is VALID [2020-07-28 17:58:25,644 INFO L280 TraceCheckUtils]: 10: Hoare triple {1389#true} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {1389#true} is VALID [2020-07-28 17:58:25,644 INFO L280 TraceCheckUtils]: 11: Hoare triple {1389#true} main_#t~ret33.base, main_#t~ret33.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev2~0.base, main_~dev2~0.offset := main_#t~ret33.base, main_#t~ret33.offset;havoc main_#t~ret33.base, main_#t~ret33.offset; {1389#true} is VALID [2020-07-28 17:58:25,647 INFO L280 TraceCheckUtils]: 12: Hoare triple {1389#true} assume (main_~dev1~0.base != 0 || main_~dev1~0.offset != 0) && (main_~dev2~0.base != 0 || main_~dev2~0.offset != 0);list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {1391#(and (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base) (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:25,648 INFO L280 TraceCheckUtils]: 13: Hoare triple {1391#(and (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base) (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset))} assume list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset; {1391#(and (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base) (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:25,649 INFO L280 TraceCheckUtils]: 14: Hoare triple {1391#(and (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base) (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset))} assume -2147483648 <= list_add_#t~nondet31 && list_add_#t~nondet31 <= 2147483647; {1391#(and (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base) (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset))} is VALID [2020-07-28 17:58:25,650 INFO L280 TraceCheckUtils]: 15: Hoare triple {1391#(and (= ULTIMATE.start_main_~dev2~0.base ULTIMATE.start_list_add_~new.base) (= ULTIMATE.start_list_add_~new.offset ULTIMATE.start_main_~dev2~0.offset))} assume 0 != list_add_#t~nondet31;havoc list_add_#t~nondet31;~elem~0.base, ~elem~0.offset := list_add_~new.base, list_add_~new.offset; {1392#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} is VALID [2020-07-28 17:58:25,651 INFO L280 TraceCheckUtils]: 16: Hoare triple {1392#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev1~0.base, main_~dev1~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {1392#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} is VALID [2020-07-28 17:58:25,652 INFO L280 TraceCheckUtils]: 17: Hoare triple {1392#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} assume list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset; {1392#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} is VALID [2020-07-28 17:58:25,652 INFO L280 TraceCheckUtils]: 18: Hoare triple {1392#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} assume -2147483648 <= list_add_#t~nondet31 && list_add_#t~nondet31 <= 2147483647; {1392#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} is VALID [2020-07-28 17:58:25,653 INFO L280 TraceCheckUtils]: 19: Hoare triple {1392#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} assume !(0 != list_add_#t~nondet31);havoc list_add_#t~nondet31; {1392#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} is VALID [2020-07-28 17:58:25,654 INFO L280 TraceCheckUtils]: 20: Hoare triple {1392#(and (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset) (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base))} list_del_#in~entry.base, list_del_#in~entry.offset := main_~dev2~0.base, main_~dev2~0.offset;havoc list_del_~entry.base, list_del_~entry.offset;list_del_~entry.base, list_del_~entry.offset := list_del_#in~entry.base, list_del_#in~entry.offset; {1393#(and (= ULTIMATE.start_list_del_~entry.base ~elem~0.base) (= ~elem~0.offset ULTIMATE.start_list_del_~entry.offset))} is VALID [2020-07-28 17:58:25,655 INFO L280 TraceCheckUtils]: 21: Hoare triple {1393#(and (= ULTIMATE.start_list_del_~entry.base ~elem~0.base) (= ~elem~0.offset ULTIMATE.start_list_del_~entry.offset))} assume !(list_del_~entry.base == ~elem~0.base && list_del_~entry.offset == ~elem~0.offset); {1390#false} is VALID [2020-07-28 17:58:25,655 INFO L280 TraceCheckUtils]: 22: Hoare triple {1390#false} list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {1390#false} is VALID [2020-07-28 17:58:25,655 INFO L280 TraceCheckUtils]: 23: Hoare triple {1390#false} assume !(list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset); {1390#false} is VALID [2020-07-28 17:58:25,655 INFO L280 TraceCheckUtils]: 24: Hoare triple {1390#false} assume !false; {1390#false} is VALID [2020-07-28 17:58:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:25,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477134220] [2020-07-28 17:58:25,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:25,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 17:58:25,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463019220] [2020-07-28 17:58:25,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-28 17:58:25,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:25,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:58:25,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:25,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:58:25,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:25,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:58:25,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:58:25,686 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 5 states. [2020-07-28 17:58:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:25,847 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2020-07-28 17:58:25,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:58:25,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-28 17:58:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:58:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-28 17:58:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:58:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-28 17:58:25,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2020-07-28 17:58:25,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:25,892 INFO L225 Difference]: With dead ends: 36 [2020-07-28 17:58:25,892 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 17:58:25,893 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:58:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 17:58:25,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-28 17:58:25,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:25,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-28 17:58:25,917 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:58:25,918 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:58:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:25,919 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2020-07-28 17:58:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2020-07-28 17:58:25,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:25,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:25,920 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:58:25,920 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:58:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:25,921 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2020-07-28 17:58:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2020-07-28 17:58:25,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:25,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:25,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:25,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 17:58:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2020-07-28 17:58:25,923 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 25 [2020-07-28 17:58:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:25,924 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2020-07-28 17:58:25,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:58:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2020-07-28 17:58:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-28 17:58:25,926 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:25,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:25,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-28 17:58:25,929 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:25,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1400103152, now seen corresponding path program 1 times [2020-07-28 17:58:25,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:25,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726307893] [2020-07-28 17:58:25,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:25,996 INFO L280 TraceCheckUtils]: 0: Hoare triple {1522#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := 0, 0;~elem~0.base, ~elem~0.offset := 0, 0;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4); {1522#true} is VALID [2020-07-28 17:58:25,996 INFO L280 TraceCheckUtils]: 1: Hoare triple {1522#true} havoc main_#res;havoc main_#t~ret32.base, main_#t~ret32.offset, main_#t~ret33.base, main_#t~ret33.offset, main_~dev1~0.base, main_~dev1~0.offset, main_~dev2~0.base, main_~dev2~0.offset;havoc main_~dev1~0.base, main_~dev1~0.offset;havoc main_~dev2~0.base, main_~dev2~0.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {1522#true} is VALID [2020-07-28 17:58:25,996 INFO L280 TraceCheckUtils]: 2: Hoare triple {1522#true} assume __getMemory_~size > 0; {1522#true} is VALID [2020-07-28 17:58:25,997 INFO L280 TraceCheckUtils]: 3: Hoare triple {1522#true} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {1522#true} is VALID [2020-07-28 17:58:25,997 INFO L280 TraceCheckUtils]: 4: Hoare triple {1522#true} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1522#true} is VALID [2020-07-28 17:58:25,997 INFO L280 TraceCheckUtils]: 5: Hoare triple {1522#true} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {1522#true} is VALID [2020-07-28 17:58:25,997 INFO L280 TraceCheckUtils]: 6: Hoare triple {1522#true} main_#t~ret32.base, main_#t~ret32.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev1~0.base, main_~dev1~0.offset := main_#t~ret32.base, main_#t~ret32.offset;havoc main_#t~ret32.base, main_#t~ret32.offset;my_malloc_#in~size := 8;havoc my_malloc_#res.base, my_malloc_#res.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset, my_malloc_~size;my_malloc_~size := my_malloc_#in~size;__getMemory_#in~size := my_malloc_~size;havoc __getMemory_#res.base, __getMemory_#res.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset, __getMemory_#t~nondet29, __getMemory_~size;__getMemory_~size := __getMemory_#in~size; {1522#true} is VALID [2020-07-28 17:58:25,997 INFO L280 TraceCheckUtils]: 7: Hoare triple {1522#true} assume __getMemory_~size > 0; {1522#true} is VALID [2020-07-28 17:58:25,998 INFO L280 TraceCheckUtils]: 8: Hoare triple {1522#true} __getMemory_#t~post28.base, __getMemory_#t~post28.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset;~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset := __getMemory_#t~post28.base, 1 + __getMemory_#t~post28.offset;havoc __getMemory_#t~post28.base, __getMemory_#t~post28.offset;assume -2147483648 <= __getMemory_#t~nondet29 && __getMemory_#t~nondet29 <= 2147483647; {1522#true} is VALID [2020-07-28 17:58:25,998 INFO L280 TraceCheckUtils]: 9: Hoare triple {1522#true} assume !(0 == __getMemory_#t~nondet29);havoc __getMemory_#t~nondet29;__getMemory_#res.base, __getMemory_#res.offset := ~guard_malloc_counter~0.base, ~guard_malloc_counter~0.offset; {1522#true} is VALID [2020-07-28 17:58:25,998 INFO L280 TraceCheckUtils]: 10: Hoare triple {1522#true} my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset := __getMemory_#res.base, __getMemory_#res.offset;my_malloc_#res.base, my_malloc_#res.offset := my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset;havoc my_malloc_#t~ret30.base, my_malloc_#t~ret30.offset; {1522#true} is VALID [2020-07-28 17:58:25,999 INFO L280 TraceCheckUtils]: 11: Hoare triple {1522#true} main_#t~ret33.base, main_#t~ret33.offset := my_malloc_#res.base, my_malloc_#res.offset;main_~dev2~0.base, main_~dev2~0.offset := main_#t~ret33.base, main_#t~ret33.offset;havoc main_#t~ret33.base, main_#t~ret33.offset; {1522#true} is VALID [2020-07-28 17:58:25,999 INFO L280 TraceCheckUtils]: 12: Hoare triple {1522#true} assume (main_~dev1~0.base != 0 || main_~dev1~0.offset != 0) && (main_~dev2~0.base != 0 || main_~dev2~0.offset != 0);list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {1522#true} is VALID [2020-07-28 17:58:25,999 INFO L280 TraceCheckUtils]: 13: Hoare triple {1522#true} assume list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset; {1522#true} is VALID [2020-07-28 17:58:25,999 INFO L280 TraceCheckUtils]: 14: Hoare triple {1522#true} assume -2147483648 <= list_add_#t~nondet31 && list_add_#t~nondet31 <= 2147483647; {1522#true} is VALID [2020-07-28 17:58:26,000 INFO L280 TraceCheckUtils]: 15: Hoare triple {1522#true} assume !(0 != list_add_#t~nondet31);havoc list_add_#t~nondet31; {1522#true} is VALID [2020-07-28 17:58:26,000 INFO L280 TraceCheckUtils]: 16: Hoare triple {1522#true} list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev1~0.base, main_~dev1~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {1522#true} is VALID [2020-07-28 17:58:26,000 INFO L280 TraceCheckUtils]: 17: Hoare triple {1522#true} assume list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset; {1522#true} is VALID [2020-07-28 17:58:26,000 INFO L280 TraceCheckUtils]: 18: Hoare triple {1522#true} assume -2147483648 <= list_add_#t~nondet31 && list_add_#t~nondet31 <= 2147483647; {1522#true} is VALID [2020-07-28 17:58:26,000 INFO L280 TraceCheckUtils]: 19: Hoare triple {1522#true} assume 0 != list_add_#t~nondet31;havoc list_add_#t~nondet31;~elem~0.base, ~elem~0.offset := list_add_~new.base, list_add_~new.offset; {1522#true} is VALID [2020-07-28 17:58:26,001 INFO L280 TraceCheckUtils]: 20: Hoare triple {1522#true} list_del_#in~entry.base, list_del_#in~entry.offset := main_~dev2~0.base, main_~dev2~0.offset;havoc list_del_~entry.base, list_del_~entry.offset;list_del_~entry.base, list_del_~entry.offset := list_del_#in~entry.base, list_del_#in~entry.offset; {1524#(and (= ULTIMATE.start_list_del_~entry.base ULTIMATE.start_main_~dev2~0.base) (= ULTIMATE.start_main_~dev2~0.offset ULTIMATE.start_list_del_~entry.offset))} is VALID [2020-07-28 17:58:26,002 INFO L280 TraceCheckUtils]: 21: Hoare triple {1524#(and (= ULTIMATE.start_list_del_~entry.base ULTIMATE.start_main_~dev2~0.base) (= ULTIMATE.start_main_~dev2~0.offset ULTIMATE.start_list_del_~entry.offset))} assume !(list_del_~entry.base == ~elem~0.base && list_del_~entry.offset == ~elem~0.offset); {1525#(or (not (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base)) (not (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset)))} is VALID [2020-07-28 17:58:26,003 INFO L280 TraceCheckUtils]: 22: Hoare triple {1525#(or (not (= ~elem~0.base ULTIMATE.start_main_~dev2~0.base)) (not (= ULTIMATE.start_main_~dev2~0.offset ~elem~0.offset)))} list_add_#in~new.base, list_add_#in~new.offset, list_add_#in~head.base, list_add_#in~head.offset := main_~dev2~0.base, main_~dev2~0.offset, ~#head~0.base, ~#head~0.offset;havoc list_add_#t~nondet31, list_add_~new.base, list_add_~new.offset, list_add_~head.base, list_add_~head.offset;list_add_~new.base, list_add_~new.offset := list_add_#in~new.base, list_add_#in~new.offset;list_add_~head.base, list_add_~head.offset := list_add_#in~head.base, list_add_#in~head.offset; {1526#(or (not (= ~elem~0.base ULTIMATE.start_list_add_~new.base)) (not (= ULTIMATE.start_list_add_~new.offset ~elem~0.offset)))} is VALID [2020-07-28 17:58:26,003 INFO L280 TraceCheckUtils]: 23: Hoare triple {1526#(or (not (= ~elem~0.base ULTIMATE.start_list_add_~new.base)) (not (= ULTIMATE.start_list_add_~new.offset ~elem~0.offset)))} assume !(list_add_~new.base != ~elem~0.base || list_add_~new.offset != ~elem~0.offset); {1523#false} is VALID [2020-07-28 17:58:26,003 INFO L280 TraceCheckUtils]: 24: Hoare triple {1523#false} assume !false; {1523#false} is VALID [2020-07-28 17:58:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:26,004 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726307893] [2020-07-28 17:58:26,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:26,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 17:58:26,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897546518] [2020-07-28 17:58:26,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-28 17:58:26,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:26,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:58:26,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:26,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:58:26,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:26,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:58:26,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:58:26,036 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand 5 states. [2020-07-28 17:58:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:26,186 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2020-07-28 17:58:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:58:26,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-28 17:58:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:58:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2020-07-28 17:58:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:58:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2020-07-28 17:58:26,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2020-07-28 17:58:26,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:26,217 INFO L225 Difference]: With dead ends: 26 [2020-07-28 17:58:26,217 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:58:26,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:58:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:58:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:58:26,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:26,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:58:26,218 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:58:26,218 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:58:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:26,219 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:58:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:58:26,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:26,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:26,219 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:58:26,219 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:58:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:26,219 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:58:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:58:26,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:26,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:26,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:26,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:58:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:58:26,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-28 17:58:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:26,220 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:58:26,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:58:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:58:26,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:26,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-28 17:58:26,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:58:26,566 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-28 17:58:26,566 INFO L268 CegarLoopResult]: For program point L895(lines 895 898) no Hoare annotation was computed. [2020-07-28 17:58:26,567 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-28 17:58:26,567 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:58:26,567 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:58:26,567 INFO L264 CegarLoopResult]: At program point L879(lines 878 880) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= 0 ~elem~0.offset))) (or (and .cse0 .cse1 (= 0 |ULTIMATE.start_my_malloc_#res.base|) (= 0 |ULTIMATE.start___getMemory_#res.base|) (= 0 |ULTIMATE.start_my_malloc_#res.offset|) (= 0 |ULTIMATE.start___getMemory_#res.offset|) (<= 1 ~guard_malloc_counter~0.offset)) (and .cse0 (<= 1 |ULTIMATE.start_my_malloc_#res.offset|) .cse1 (<= 1 |ULTIMATE.start___getMemory_#res.offset|) (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset)))) [2020-07-28 17:58:26,568 INFO L264 CegarLoopResult]: At program point L879-1(lines 878 880) the Hoare annotation is: (let ((.cse2 (= 0 ~elem~0.offset)) (.cse0 (= ULTIMATE.start___getMemory_~size 8))) (or (let ((.cse1 (+ ULTIMATE.start_main_~dev1~0.offset 1))) (and .cse0 (<= .cse1 |ULTIMATE.start_my_malloc_#res.offset|) .cse2 (<= 1 ULTIMATE.start_main_~dev1~0.offset) (<= .cse1 |ULTIMATE.start___getMemory_#res.offset|) (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset))) (and (= 0 ULTIMATE.start_main_~dev1~0.offset) .cse0 .cse2 (<= 2 |ULTIMATE.start___getMemory_#res.offset|) (<= 2 ~guard_malloc_counter~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base) (<= 2 |ULTIMATE.start_my_malloc_#res.offset|)) (and .cse0 (= 0 |ULTIMATE.start_my_malloc_#res.base|) (= 0 |ULTIMATE.start___getMemory_#res.base|) (= 0 |ULTIMATE.start_my_malloc_#res.offset|) (= 0 |ULTIMATE.start___getMemory_#res.offset|)))) [2020-07-28 17:58:26,568 INFO L268 CegarLoopResult]: For program point L871(line 871) no Hoare annotation was computed. [2020-07-28 17:58:26,568 INFO L268 CegarLoopResult]: For program point L871-2(line 871) no Hoare annotation was computed. [2020-07-28 17:58:26,568 INFO L268 CegarLoopResult]: For program point L4(lines 1 917) no Hoare annotation was computed. [2020-07-28 17:58:26,568 INFO L268 CegarLoopResult]: For program point L4-1(lines 1 917) no Hoare annotation was computed. [2020-07-28 17:58:26,568 INFO L268 CegarLoopResult]: For program point L4-2(lines 1 917) no Hoare annotation was computed. [2020-07-28 17:58:26,568 INFO L268 CegarLoopResult]: For program point L4-3(lines 1 917) no Hoare annotation was computed. [2020-07-28 17:58:26,569 INFO L268 CegarLoopResult]: For program point L896(lines 896 897) no Hoare annotation was computed. [2020-07-28 17:58:26,569 INFO L268 CegarLoopResult]: For program point L4-4(lines 1 917) no Hoare annotation was computed. [2020-07-28 17:58:26,569 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-28 17:58:26,570 INFO L268 CegarLoopResult]: For program point L889(lines 889 893) no Hoare annotation was computed. [2020-07-28 17:58:26,570 INFO L268 CegarLoopResult]: For program point L889-1(lines 889 893) no Hoare annotation was computed. [2020-07-28 17:58:26,570 INFO L268 CegarLoopResult]: For program point L906(lines 906 915) no Hoare annotation was computed. [2020-07-28 17:58:26,570 INFO L268 CegarLoopResult]: For program point L873(lines 873 874) no Hoare annotation was computed. [2020-07-28 17:58:26,570 INFO L268 CegarLoopResult]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2020-07-28 17:58:26,571 INFO L268 CegarLoopResult]: For program point L873-1(lines 873 874) no Hoare annotation was computed. [2020-07-28 17:58:26,571 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-28 17:58:26,571 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-28 17:58:26,571 INFO L268 CegarLoopResult]: For program point L6-2(line 6) no Hoare annotation was computed. [2020-07-28 17:58:26,571 INFO L268 CegarLoopResult]: For program point L6-3(line 6) no Hoare annotation was computed. [2020-07-28 17:58:26,571 INFO L268 CegarLoopResult]: For program point L6-4(line 6) no Hoare annotation was computed. [2020-07-28 17:58:26,572 INFO L268 CegarLoopResult]: For program point L890(line 890) no Hoare annotation was computed. [2020-07-28 17:58:26,572 INFO L268 CegarLoopResult]: For program point L890-2(line 890) no Hoare annotation was computed. [2020-07-28 17:58:26,572 INFO L268 CegarLoopResult]: For program point L890-4(line 890) no Hoare annotation was computed. [2020-07-28 17:58:26,572 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:58:26,572 INFO L268 CegarLoopResult]: For program point L891(lines 891 892) no Hoare annotation was computed. [2020-07-28 17:58:26,572 INFO L268 CegarLoopResult]: For program point L891-2(lines 891 892) no Hoare annotation was computed. [2020-07-28 17:58:26,573 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-28 17:58:26,573 INFO L268 CegarLoopResult]: For program point L891-4(lines 891 892) no Hoare annotation was computed. [2020-07-28 17:58:26,573 INFO L264 CegarLoopResult]: At program point L916(lines 902 917) the Hoare annotation is: (= 8 ULTIMATE.start___getMemory_~size) [2020-07-28 17:58:26,573 INFO L264 CegarLoopResult]: At program point L875(lines 869 876) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= 0 ~elem~0.offset))) (or (and .cse0 .cse1 (<= 1 |ULTIMATE.start___getMemory_#res.offset|) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset)) (and .cse0 .cse1 (= 0 |ULTIMATE.start___getMemory_#res.base|) (= 0 |ULTIMATE.start___getMemory_#res.offset|) (<= 1 ~guard_malloc_counter~0.offset)))) [2020-07-28 17:58:26,574 INFO L264 CegarLoopResult]: At program point L875-1(lines 869 876) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= 0 ~elem~0.offset))) (or (and (= 0 ULTIMATE.start_main_~dev1~0.offset) .cse0 .cse1 (<= 2 |ULTIMATE.start___getMemory_#res.offset|) (<= 2 ~guard_malloc_counter~0.offset) (= 0 ULTIMATE.start_main_~dev1~0.base)) (and .cse0 (= 0 |ULTIMATE.start___getMemory_#res.base|) (= 0 |ULTIMATE.start___getMemory_#res.offset|)) (and .cse0 .cse1 (<= 1 ULTIMATE.start_main_~dev1~0.offset) (<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start___getMemory_#res.offset|) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset)))) [2020-07-28 17:58:26,574 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:58:26,574 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-28 17:58:26,578 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:58:26,578 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:58:26,578 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2020-07-28 17:58:26,578 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2020-07-28 17:58:26,579 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 17:58:26,579 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 17:58:26,579 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 17:58:26,579 WARN L170 areAnnotationChecker]: L873 has no Hoare annotation [2020-07-28 17:58:26,579 WARN L170 areAnnotationChecker]: L873 has no Hoare annotation [2020-07-28 17:58:26,581 WARN L170 areAnnotationChecker]: L871-2 has no Hoare annotation [2020-07-28 17:58:26,581 WARN L170 areAnnotationChecker]: L871-2 has no Hoare annotation [2020-07-28 17:58:26,581 WARN L170 areAnnotationChecker]: L871-2 has no Hoare annotation [2020-07-28 17:58:26,581 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-28 17:58:26,581 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 17:58:26,581 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 17:58:26,581 WARN L170 areAnnotationChecker]: L873-1 has no Hoare annotation [2020-07-28 17:58:26,581 WARN L170 areAnnotationChecker]: L873-1 has no Hoare annotation [2020-07-28 17:58:26,586 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2020-07-28 17:58:26,587 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2020-07-28 17:58:26,587 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2020-07-28 17:58:26,587 WARN L170 areAnnotationChecker]: L890 has no Hoare annotation [2020-07-28 17:58:26,587 WARN L170 areAnnotationChecker]: L890 has no Hoare annotation [2020-07-28 17:58:26,587 WARN L170 areAnnotationChecker]: L906-1 has no Hoare annotation [2020-07-28 17:58:26,587 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-28 17:58:26,587 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2020-07-28 17:58:26,587 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2020-07-28 17:58:26,587 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:58:26,588 WARN L170 areAnnotationChecker]: L891 has no Hoare annotation [2020-07-28 17:58:26,588 WARN L170 areAnnotationChecker]: L891 has no Hoare annotation [2020-07-28 17:58:26,588 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:58:26,588 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2020-07-28 17:58:26,588 WARN L170 areAnnotationChecker]: L890-2 has no Hoare annotation [2020-07-28 17:58:26,588 WARN L170 areAnnotationChecker]: L890-2 has no Hoare annotation [2020-07-28 17:58:26,588 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-28 17:58:26,588 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-28 17:58:26,588 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2020-07-28 17:58:26,588 WARN L170 areAnnotationChecker]: L891-2 has no Hoare annotation [2020-07-28 17:58:26,588 WARN L170 areAnnotationChecker]: L891-2 has no Hoare annotation [2020-07-28 17:58:26,588 WARN L170 areAnnotationChecker]: L889-1 has no Hoare annotation [2020-07-28 17:58:26,589 WARN L170 areAnnotationChecker]: L896 has no Hoare annotation [2020-07-28 17:58:26,589 WARN L170 areAnnotationChecker]: L896 has no Hoare annotation [2020-07-28 17:58:26,589 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2020-07-28 17:58:26,589 WARN L170 areAnnotationChecker]: L890-4 has no Hoare annotation [2020-07-28 17:58:26,589 WARN L170 areAnnotationChecker]: L890-4 has no Hoare annotation [2020-07-28 17:58:26,589 WARN L170 areAnnotationChecker]: L4-4 has no Hoare annotation [2020-07-28 17:58:26,589 WARN L170 areAnnotationChecker]: L6-4 has no Hoare annotation [2020-07-28 17:58:26,589 WARN L170 areAnnotationChecker]: L6-4 has no Hoare annotation [2020-07-28 17:58:26,589 WARN L170 areAnnotationChecker]: L891-4 has no Hoare annotation [2020-07-28 17:58:26,589 WARN L170 areAnnotationChecker]: L891-4 has no Hoare annotation [2020-07-28 17:58:26,589 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:58:26,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:58:26 BoogieIcfgContainer [2020-07-28 17:58:26,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:58:26,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:58:26,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:58:26,618 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:58:26,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:58:19" (3/4) ... [2020-07-28 17:58:26,622 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 17:58:26,636 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2020-07-28 17:58:26,636 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-07-28 17:58:26,636 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 17:58:26,672 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((size == 8 && 0 == elem) && 1 <= \result) && \result <= guard_malloc_counter) || ((((size == 8 && 0 == elem) && 0 == \result) && 0 == \result) && 1 <= guard_malloc_counter) [2020-07-28 17:58:26,672 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((size == 8 && 0 == elem) && 0 == \result) && 0 == \result) && 0 == \result) && 0 == \result) && 1 <= guard_malloc_counter) || (((((size == 8 && 1 <= \result) && 0 == elem) && 1 <= \result) && \result <= guard_malloc_counter) && \result <= guard_malloc_counter) [2020-07-28 17:58:26,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == dev1 && size == 8) && 0 == elem) && 2 <= \result) && 2 <= guard_malloc_counter) && 0 == dev1) || ((size == 8 && 0 == \result) && 0 == \result)) || ((((size == 8 && 0 == elem) && 1 <= dev1) && dev1 + 1 <= \result) && \result <= guard_malloc_counter) [2020-07-28 17:58:26,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((size == 8 && dev1 + 1 <= \result) && 0 == elem) && 1 <= dev1) && dev1 + 1 <= \result) && \result <= guard_malloc_counter) && \result <= guard_malloc_counter) || ((((((0 == dev1 && size == 8) && 0 == elem) && 2 <= \result) && 2 <= guard_malloc_counter) && 0 == dev1) && 2 <= \result)) || ((((size == 8 && 0 == \result) && 0 == \result) && 0 == \result) && 0 == \result) [2020-07-28 17:58:26,709 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:58:26,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:58:26,712 INFO L168 Benchmark]: Toolchain (without parser) took 8543.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.7 MB). Free memory was 960.2 MB in the beginning and 1.0 GB in the end (delta: -44.4 MB). Peak memory consumption was 230.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:58:26,712 INFO L168 Benchmark]: CDTParser took 0.71 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:58:26,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 560.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -106.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:58:26,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:58:26,713 INFO L168 Benchmark]: Boogie Preprocessor took 33.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:58:26,714 INFO L168 Benchmark]: RCFGBuilder took 571.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:58:26,714 INFO L168 Benchmark]: TraceAbstraction took 7215.38 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.8 MB). Peak memory consumption was 205.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:58:26,715 INFO L168 Benchmark]: Witness Printer took 91.54 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:58:26,717 INFO L336 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.71 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 560.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -106.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 571.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7215.38 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.8 MB). Peak memory consumption was 205.5 MB. Max. memory is 11.5 GB. * Witness Printer took 91.54 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 902]: Loop Invariant Derived loop invariant: 8 == size - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: (((((((size == 8 && dev1 + 1 <= \result) && 0 == elem) && 1 <= dev1) && dev1 + 1 <= \result) && \result <= guard_malloc_counter) && \result <= guard_malloc_counter) || ((((((0 == dev1 && size == 8) && 0 == elem) && 2 <= \result) && 2 <= guard_malloc_counter) && 0 == dev1) && 2 <= \result)) || ((((size == 8 && 0 == \result) && 0 == \result) && 0 == \result) && 0 == \result) - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: (((size == 8 && 0 == elem) && 1 <= \result) && \result <= guard_malloc_counter) || ((((size == 8 && 0 == elem) && 0 == \result) && 0 == \result) && 1 <= guard_malloc_counter) - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: ((((((0 == dev1 && size == 8) && 0 == elem) && 2 <= \result) && 2 <= guard_malloc_counter) && 0 == dev1) || ((size == 8 && 0 == \result) && 0 == \result)) || ((((size == 8 && 0 == elem) && 1 <= dev1) && dev1 + 1 <= \result) && \result <= guard_malloc_counter) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((((size == 8 && 0 == elem) && 0 == \result) && 0 == \result) && 0 == \result) && 0 == \result) && 1 <= guard_malloc_counter) || (((((size == 8 && 1 <= \result) && 0 == elem) && 1 <= \result) && \result <= guard_malloc_counter) && \result <= guard_malloc_counter) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.7s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 242 SDtfs, 445 SDslu, 528 SDs, 0 SdLazy, 560 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 16 NumberOfFragments, 188 HoareAnnotationTreeSize, 5 FomulaSimplifications, 56 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 13675 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...