./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_false-unreach-call_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_false-unreach-call_1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f18f7f1f917468e24f0e5d26966f1156107884dd ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:35:41,633 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:35:41,634 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:35:41,641 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:35:41,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:35:41,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:35:41,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:35:41,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:35:41,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:35:41,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:35:41,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:35:41,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:35:41,648 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:35:41,649 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:35:41,650 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:35:41,650 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:35:41,651 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:35:41,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:35:41,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:35:41,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:35:41,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:35:41,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:35:41,659 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:35:41,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:35:41,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:35:41,660 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:35:41,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:35:41,662 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:35:41,663 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:35:41,664 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:35:41,664 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:35:41,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:35:41,665 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:35:41,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:35:41,666 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:35:41,667 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:35:41,667 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 11:35:41,677 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:35:41,677 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:35:41,678 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:35:41,678 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:35:41,678 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:35:41,678 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:35:41,678 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:35:41,678 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:35:41,678 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:35:41,678 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:35:41,678 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:35:41,679 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:35:41,679 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:35:41,679 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:35:41,679 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:35:41,679 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:35:41,680 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:35:41,680 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:35:41,680 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:35:41,680 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:35:41,680 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:35:41,680 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:35:41,680 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:35:41,681 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:35:41,681 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:35:41,681 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:35:41,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:35:41,681 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:35:41,683 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:35:41,683 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:35:41,683 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:35:41,683 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:35:41,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:35:41,683 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:35:41,683 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan 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 -> Taipan 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 -> f18f7f1f917468e24f0e5d26966f1156107884dd [2018-11-10 11:35:41,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:35:41,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:35:41,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:35:41,720 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:35:41,721 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:35:41,721 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_false-unreach-call_1.i [2018-11-10 11:35:41,764 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/data/fff86f15f/22624044c9414d6493cf54a68e5e97db/FLAG1f773b5f9 [2018-11-10 11:35:42,175 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:35:42,176 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_false-unreach-call_1.i [2018-11-10 11:35:42,181 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/data/fff86f15f/22624044c9414d6493cf54a68e5e97db/FLAG1f773b5f9 [2018-11-10 11:35:42,189 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/data/fff86f15f/22624044c9414d6493cf54a68e5e97db [2018-11-10 11:35:42,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:35:42,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:35:42,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:35:42,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:35:42,196 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:35:42,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:35:42" (1/1) ... [2018-11-10 11:35:42,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa5b77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42, skipping insertion in model container [2018-11-10 11:35:42,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:35:42" (1/1) ... [2018-11-10 11:35:42,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:35:42,231 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:35:42,401 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:35:42,405 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:35:42,433 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:35:42,473 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:35:42,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42 WrapperNode [2018-11-10 11:35:42,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:35:42,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:35:42,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:35:42,474 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:35:42,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42" (1/1) ... [2018-11-10 11:35:42,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42" (1/1) ... [2018-11-10 11:35:42,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:35:42,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:35:42,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:35:42,551 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:35:42,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42" (1/1) ... [2018-11-10 11:35:42,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42" (1/1) ... [2018-11-10 11:35:42,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42" (1/1) ... [2018-11-10 11:35:42,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42" (1/1) ... [2018-11-10 11:35:42,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42" (1/1) ... [2018-11-10 11:35:42,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42" (1/1) ... [2018-11-10 11:35:42,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42" (1/1) ... [2018-11-10 11:35:42,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:35:42,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:35:42,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:35:42,569 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:35:42,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/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 [2018-11-10 11:35:42,616 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2018-11-10 11:35:42,617 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2018-11-10 11:35:42,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:35:42,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:35:42,617 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:35:42,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:35:42,617 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-11-10 11:35:42,617 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-11-10 11:35:42,617 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-10 11:35:42,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-10 11:35:42,618 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2018-11-10 11:35:42,618 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2018-11-10 11:35:42,618 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2018-11-10 11:35:42,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2018-11-10 11:35:42,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:35:42,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:35:42,905 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:35:42,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:35:42 BoogieIcfgContainer [2018-11-10 11:35:42,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:35:42,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:35:42,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:35:42,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:35:42,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:35:42" (1/3) ... [2018-11-10 11:35:42,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11bb5226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:35:42, skipping insertion in model container [2018-11-10 11:35:42,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:35:42" (2/3) ... [2018-11-10 11:35:42,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11bb5226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:35:42, skipping insertion in model container [2018-11-10 11:35:42,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:35:42" (3/3) ... [2018-11-10 11:35:42,915 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2_true-termination.c_false-unreach-call_1.i [2018-11-10 11:35:42,921 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:35:42,927 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:35:42,937 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:35:42,961 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:35:42,961 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:35:42,962 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:35:42,962 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:35:42,962 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:35:42,962 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:35:42,962 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:35:42,962 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:35:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-10 11:35:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 11:35:42,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:35:42,980 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:42,982 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:35:42,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:42,986 INFO L82 PathProgramCache]: Analyzing trace with hash -695557442, now seen corresponding path program 1 times [2018-11-10 11:35:42,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:35:43,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:43,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:43,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:43,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:35:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:35:43,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:35:43,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:35:43,177 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:35:43,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:35:43,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:35:43,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:35:43,189 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-11-10 11:35:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:35:43,267 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2018-11-10 11:35:43,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:35:43,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-10 11:35:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:35:43,275 INFO L225 Difference]: With dead ends: 86 [2018-11-10 11:35:43,275 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 11:35:43,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:35:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 11:35:43,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-10 11:35:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 11:35:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-10 11:35:43,306 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 13 [2018-11-10 11:35:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:35:43,306 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-10 11:35:43,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:35:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-10 11:35:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 11:35:43,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:35:43,308 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:43,309 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:35:43,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash -314025953, now seen corresponding path program 1 times [2018-11-10 11:35:43,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:35:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:43,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:43,311 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:35:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:35:43,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:35:43,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 11:35:43,424 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:35:43,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:35:43,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:35:43,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:35:43,426 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 7 states. [2018-11-10 11:35:43,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:35:43,443 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-10 11:35:43,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:35:43,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-10 11:35:43,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:35:43,446 INFO L225 Difference]: With dead ends: 65 [2018-11-10 11:35:43,446 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 11:35:43,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:35:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 11:35:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-10 11:35:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 11:35:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-10 11:35:43,455 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 38 [2018-11-10 11:35:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:35:43,455 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-10 11:35:43,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:35:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-10 11:35:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 11:35:43,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:35:43,456 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:43,457 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:35:43,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash -607428960, now seen corresponding path program 1 times [2018-11-10 11:35:43,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:35:43,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:43,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:43,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:43,459 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:35:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:35:43,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:35:43,554 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:35:43,554 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-10 11:35:43,555 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [19], [30], [36], [38], [40], [43], [54], [57], [62], [65], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80] [2018-11-10 11:35:43,590 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:35:43,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:35:43,961 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:35:43,963 INFO L272 AbstractInterpreter]: Visited 27 different actions 73 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-11-10 11:35:43,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:43,986 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:35:44,351 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 59.62% of their original sizes. [2018-11-10 11:35:44,352 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:35:46,438 INFO L415 sIntCurrentIteration]: We unified 37 AI predicates to 37 [2018-11-10 11:35:46,438 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:35:46,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:35:46,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [7] total 32 [2018-11-10 11:35:46,439 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:35:46,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 11:35:46,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 11:35:46,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-11-10 11:35:46,440 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 27 states. [2018-11-10 11:35:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:35:50,952 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2018-11-10 11:35:50,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 11:35:50,952 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 38 [2018-11-10 11:35:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:35:50,953 INFO L225 Difference]: With dead ends: 71 [2018-11-10 11:35:50,953 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 11:35:50,954 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=148, Invalid=1412, Unknown=0, NotChecked=0, Total=1560 [2018-11-10 11:35:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 11:35:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-11-10 11:35:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 11:35:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-11-10 11:35:50,965 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 38 [2018-11-10 11:35:50,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:35:50,965 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-10 11:35:50,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 11:35:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-11-10 11:35:50,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 11:35:50,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:35:50,966 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 11:35:50,966 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:35:50,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:50,967 INFO L82 PathProgramCache]: Analyzing trace with hash -988491854, now seen corresponding path program 1 times [2018-11-10 11:35:50,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:35:50,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:50,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:50,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:50,968 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:35:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:35:51,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:35:51,018 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:35:51,018 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-10 11:35:51,018 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [54], [57], [62], [65], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82] [2018-11-10 11:35:51,020 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:35:51,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:35:51,145 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:35:51,146 INFO L272 AbstractInterpreter]: Visited 33 different actions 85 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-11-10 11:35:51,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:51,147 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:35:51,321 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 61.9% of their original sizes. [2018-11-10 11:35:51,322 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:35:53,647 INFO L415 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-11-10 11:35:53,647 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:35:53,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:35:53,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [7] total 38 [2018-11-10 11:35:53,648 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:35:53,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-10 11:35:53,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 11:35:53,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 11:35:53,649 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 33 states. [2018-11-10 11:36:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:01,500 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2018-11-10 11:36:01,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 11:36:01,500 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 45 [2018-11-10 11:36:01,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:01,502 INFO L225 Difference]: With dead ends: 90 [2018-11-10 11:36:01,502 INFO L226 Difference]: Without dead ends: 84 [2018-11-10 11:36:01,503 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=182, Invalid=2170, Unknown=0, NotChecked=0, Total=2352 [2018-11-10 11:36:01,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-10 11:36:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2018-11-10 11:36:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 11:36:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-11-10 11:36:01,516 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 45 [2018-11-10 11:36:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:01,517 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-11-10 11:36:01,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-10 11:36:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-10 11:36:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 11:36:01,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:01,518 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 11:36:01,519 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:36:01,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:01,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1797838480, now seen corresponding path program 1 times [2018-11-10 11:36:01,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:01,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:01,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:01,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:01,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:36:01,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:36:01,588 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:36:01,588 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-10 11:36:01,589 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [17], [19], [22], [27], [29], [30], [36], [38], [40], [43], [54], [57], [62], [65], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82] [2018-11-10 11:36:01,590 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:36:01,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:36:01,696 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:36:01,696 INFO L272 AbstractInterpreter]: Visited 33 different actions 85 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-11-10 11:36:01,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:01,705 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:36:01,856 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 61.9% of their original sizes. [2018-11-10 11:36:01,857 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:36:04,230 INFO L415 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-11-10 11:36:04,230 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:36:04,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:36:04,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [7] total 37 [2018-11-10 11:36:04,231 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:04,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-10 11:36:04,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-10 11:36:04,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-11-10 11:36:04,232 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 32 states. [2018-11-10 11:36:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:11,020 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2018-11-10 11:36:11,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 11:36:11,020 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-11-10 11:36:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:11,021 INFO L225 Difference]: With dead ends: 103 [2018-11-10 11:36:11,021 INFO L226 Difference]: Without dead ends: 97 [2018-11-10 11:36:11,022 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=220, Invalid=2036, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 11:36:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-10 11:36:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2018-11-10 11:36:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 11:36:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2018-11-10 11:36:11,035 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 45 [2018-11-10 11:36:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:11,036 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-11-10 11:36:11,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-10 11:36:11,036 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2018-11-10 11:36:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 11:36:11,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:11,037 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-11-10 11:36:11,037 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:36:11,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:11,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1913090107, now seen corresponding path program 1 times [2018-11-10 11:36:11,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:11,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:11,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:11,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:11,038 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 11:36:11,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:36:11,098 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:36:11,098 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 11:36:11,098 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [9], [13], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [54], [57], [62], [65], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86] [2018-11-10 11:36:11,100 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:36:11,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:36:11,217 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:36:11,217 INFO L272 AbstractInterpreter]: Visited 37 different actions 89 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-11-10 11:36:11,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:11,221 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:36:11,403 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 63.19% of their original sizes. [2018-11-10 11:36:11,404 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:36:14,366 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 11:36:14,366 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:36:14,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:36:14,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [7] total 44 [2018-11-10 11:36:14,367 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:14,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-10 11:36:14,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-10 11:36:14,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1382, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 11:36:14,367 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand 39 states. [2018-11-10 11:36:22,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:22,432 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2018-11-10 11:36:22,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 11:36:22,432 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 57 [2018-11-10 11:36:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:22,433 INFO L225 Difference]: With dead ends: 131 [2018-11-10 11:36:22,433 INFO L226 Difference]: Without dead ends: 118 [2018-11-10 11:36:22,434 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=214, Invalid=2978, Unknown=0, NotChecked=0, Total=3192 [2018-11-10 11:36:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-10 11:36:22,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2018-11-10 11:36:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 11:36:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2018-11-10 11:36:22,447 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 57 [2018-11-10 11:36:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:22,448 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2018-11-10 11:36:22,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-10 11:36:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2018-11-10 11:36:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 11:36:22,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:22,448 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-11-10 11:36:22,448 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:36:22,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:22,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1572530563, now seen corresponding path program 1 times [2018-11-10 11:36:22,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:22,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:22,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:22,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:22,450 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 11:36:22,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:36:22,518 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:36:22,518 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 11:36:22,519 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [54], [57], [62], [65], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86] [2018-11-10 11:36:22,520 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:36:22,520 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:36:22,641 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:36:22,641 INFO L272 AbstractInterpreter]: Visited 40 different actions 98 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-11-10 11:36:22,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:22,642 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:36:22,815 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 64.32% of their original sizes. [2018-11-10 11:36:22,815 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:36:26,011 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 11:36:26,012 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:36:26,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:36:26,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [7] total 46 [2018-11-10 11:36:26,012 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:26,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-10 11:36:26,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-10 11:36:26,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1536, Unknown=0, NotChecked=0, Total=1640 [2018-11-10 11:36:26,013 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 41 states. [2018-11-10 11:36:35,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:35,344 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-10 11:36:35,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-10 11:36:35,344 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 57 [2018-11-10 11:36:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:35,346 INFO L225 Difference]: With dead ends: 136 [2018-11-10 11:36:35,346 INFO L226 Difference]: Without dead ends: 125 [2018-11-10 11:36:35,347 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=238, Invalid=3544, Unknown=0, NotChecked=0, Total=3782 [2018-11-10 11:36:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-10 11:36:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2018-11-10 11:36:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 11:36:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2018-11-10 11:36:35,366 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 57 [2018-11-10 11:36:35,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:35,367 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2018-11-10 11:36:35,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-10 11:36:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2018-11-10 11:36:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 11:36:35,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:35,369 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-11-10 11:36:35,369 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:36:35,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:35,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1795071175, now seen corresponding path program 1 times [2018-11-10 11:36:35,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:35,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:35,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:35,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:35,370 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 11:36:35,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:36:35,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:36:35,449 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 11:36:35,449 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [9], [13], [14], [17], [19], [22], [25], [27], [29], [30], [36], [38], [40], [43], [54], [57], [62], [65], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86] [2018-11-10 11:36:35,450 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:36:35,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:36:35,760 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:36:35,761 INFO L272 AbstractInterpreter]: Visited 41 different actions 125 times. Merged at 13 different actions 34 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 32 variables. [2018-11-10 11:36:35,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:35,762 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:36:35,978 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 64.32% of their original sizes. [2018-11-10 11:36:35,978 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:36:39,966 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 11:36:39,966 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:36:39,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:36:39,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [7] total 47 [2018-11-10 11:36:39,966 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:39,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-10 11:36:39,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-10 11:36:39,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1525, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 11:36:39,967 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 42 states. [2018-11-10 11:36:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:53,104 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2018-11-10 11:36:53,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-10 11:36:53,105 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 57 [2018-11-10 11:36:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:53,106 INFO L225 Difference]: With dead ends: 190 [2018-11-10 11:36:53,106 INFO L226 Difference]: Without dead ends: 126 [2018-11-10 11:36:53,107 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 82 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=429, Invalid=4127, Unknown=0, NotChecked=0, Total=4556 [2018-11-10 11:36:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-10 11:36:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 89. [2018-11-10 11:36:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 11:36:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-11-10 11:36:53,119 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 57 [2018-11-10 11:36:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:53,119 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-11-10 11:36:53,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-10 11:36:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-11-10 11:36:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 11:36:53,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:53,120 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-11-10 11:36:53,121 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:36:53,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash 754882113, now seen corresponding path program 1 times [2018-11-10 11:36:53,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:53,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:53,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 11:36:53,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:36:53,202 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:36:53,202 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 11:36:53,202 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [27], [29], [30], [36], [38], [40], [43], [54], [57], [62], [65], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86] [2018-11-10 11:36:53,204 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:36:53,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:36:53,502 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:36:53,502 INFO L272 AbstractInterpreter]: Visited 43 different actions 149 times. Merged at 14 different actions 40 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-11-10 11:36:53,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:53,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:36:53,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:36:53,510 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:36:53,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:53,520 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:36:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:53,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:36:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 11:36:53,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:36:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 11:36:54,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:36:54,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21, 23] total 42 [2018-11-10 11:36:54,298 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:36:54,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-10 11:36:54,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 11:36:54,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 11:36:54,299 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 26 states. [2018-11-10 11:36:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:55,108 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-11-10 11:36:55,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 11:36:55,108 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-11-10 11:36:55,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:55,109 INFO L225 Difference]: With dead ends: 158 [2018-11-10 11:36:55,109 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 11:36:55,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=3149, Unknown=0, NotChecked=0, Total=3540 [2018-11-10 11:36:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 11:36:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-10 11:36:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 11:36:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-11-10 11:36:55,129 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 57 [2018-11-10 11:36:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:55,130 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-11-10 11:36:55,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-10 11:36:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-10 11:36:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 11:36:55,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:55,131 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-11-10 11:36:55,131 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:36:55,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash -945858366, now seen corresponding path program 1 times [2018-11-10 11:36:55,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:55,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:55,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:55,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:55,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 11:36:55,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:36:55,402 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:36:55,402 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 11:36:55,402 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [27], [29], [30], [36], [38], [40], [43], [54], [57], [62], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86] [2018-11-10 11:36:55,403 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:36:55,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:36:55,662 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:36:55,662 INFO L272 AbstractInterpreter]: Visited 40 different actions 99 times. Merged at 5 different actions 14 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 32 variables. [2018-11-10 11:36:55,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:55,684 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:36:56,009 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 64.32% of their original sizes. [2018-11-10 11:36:56,010 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:37:00,234 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 11:37:00,234 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:37:00,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:37:00,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [20] total 60 [2018-11-10 11:37:00,234 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:37:00,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-10 11:37:00,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-10 11:37:00,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1502, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 11:37:00,235 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 42 states. [2018-11-10 11:37:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:37:08,962 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2018-11-10 11:37:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 11:37:08,962 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 57 [2018-11-10 11:37:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:37:08,963 INFO L225 Difference]: With dead ends: 120 [2018-11-10 11:37:08,963 INFO L226 Difference]: Without dead ends: 99 [2018-11-10 11:37:08,964 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 77 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=414, Invalid=3492, Unknown=0, NotChecked=0, Total=3906 [2018-11-10 11:37:08,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-10 11:37:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 65. [2018-11-10 11:37:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 11:37:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-11-10 11:37:08,975 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 57 [2018-11-10 11:37:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:37:08,977 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-11-10 11:37:08,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-10 11:37:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-11-10 11:37:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 11:37:08,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:37:08,978 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-11-10 11:37:08,978 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:37:08,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:37:08,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1081406834, now seen corresponding path program 1 times [2018-11-10 11:37:08,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:37:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:37:08,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:37:08,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:37:08,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:37:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:37:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 11:37:09,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:37:09,130 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:37:09,130 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-11-10 11:37:09,130 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [54], [57], [62], [66], [67], [68], [69], [70], [72], [73], [74], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-10 11:37:09,131 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:37:09,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:37:09,208 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:37:09,208 INFO L272 AbstractInterpreter]: Visited 41 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-11-10 11:37:09,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:37:09,210 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:37:09,353 INFO L227 lantSequenceWeakener]: Weakened 60 states. On average, predicates are now at 65.09% of their original sizes. [2018-11-10 11:37:09,353 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:37:11,875 INFO L415 sIntCurrentIteration]: We unified 63 AI predicates to 63 [2018-11-10 11:37:11,875 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:37:11,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:37:11,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [19] total 60 [2018-11-10 11:37:11,876 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:37:11,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-10 11:37:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-10 11:37:11,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1692, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 11:37:11,876 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 43 states. [2018-11-10 11:37:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:37:17,273 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-11-10 11:37:17,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-10 11:37:17,273 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 64 [2018-11-10 11:37:17,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:37:17,273 INFO L225 Difference]: With dead ends: 100 [2018-11-10 11:37:17,274 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 11:37:17,274 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 80 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=219, Invalid=3321, Unknown=0, NotChecked=0, Total=3540 [2018-11-10 11:37:17,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 11:37:17,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2018-11-10 11:37:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 11:37:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-11-10 11:37:17,293 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 64 [2018-11-10 11:37:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:37:17,293 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-10 11:37:17,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-10 11:37:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-10 11:37:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 11:37:17,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:37:17,293 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-11-10 11:37:17,294 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:37:17,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:37:17,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1890753460, now seen corresponding path program 1 times [2018-11-10 11:37:17,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:37:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:37:17,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:37:17,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:37:17,295 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:37:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:37:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:37:17,335 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 11:37:17,344 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:37:17,345 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:37:17,345 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:37:17,346 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:37:17,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:37:17 BoogieIcfgContainer [2018-11-10 11:37:17,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:37:17,377 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:37:17,377 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:37:17,377 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:37:17,378 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:35:42" (3/4) ... [2018-11-10 11:37:17,379 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 11:37:17,381 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:37:17,381 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:37:17,381 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:37:17,381 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:37:17,425 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_08a353a3-8014-4395-bc4a-b9c20450f706/bin-2019/utaipan/witness.graphml [2018-11-10 11:37:17,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:37:17,426 INFO L168 Benchmark]: Toolchain (without parser) took 95234.10 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 545.3 MB). Free memory was 957.5 MB in the beginning and 885.6 MB in the end (delta: 72.0 MB). Peak memory consumption was 617.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:37:17,427 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:37:17,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.75 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 928.0 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:37:17,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 928.0 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:37:17,427 INFO L168 Benchmark]: Boogie Preprocessor took 18.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:37:17,427 INFO L168 Benchmark]: RCFGBuilder took 337.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:37:17,428 INFO L168 Benchmark]: TraceAbstraction took 94469.86 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 406.3 MB). Free memory was 1.1 GB in the beginning and 900.8 MB in the end (delta: 199.1 MB). Peak memory consumption was 605.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:37:17,428 INFO L168 Benchmark]: Witness Printer took 47.96 ms. Allocated memory is still 1.6 GB. Free memory was 900.8 MB in the beginning and 885.6 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:37:17,430 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.75 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 928.0 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 928.0 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 337.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 94469.86 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 406.3 MB). Free memory was 1.1 GB in the beginning and 900.8 MB in the end (delta: 199.1 MB). Peak memory consumption was 605.4 MB. Max. memory is 11.5 GB. * Witness Printer took 47.96 ms. Allocated memory is still 1.6 GB. Free memory was 900.8 MB in the beginning and 885.6 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L867] void * guard_malloc_counter = 0; [L887] struct list_head *elem = ((void *)0); [L900] CALL static struct list_head head; [L900] RET static struct list_head head; [L900] RET static struct list_head head; [L900] RET static struct list_head head; [L903] struct list_head *dev1, *dev2; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:0}, head={11:0}] [L904] CALL, EXPR my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={11:0}] [L879] CALL, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={11:0}] [L871] COND TRUE (size > 0) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={11:0}, size=8] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] RET return (void *) guard_malloc_counter; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, \result={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={11:0}, size=8] [L879] EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, __getMemory(size)={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={11:0}, size=8] [L879] RET return __getMemory(size); [L904] EXPR my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:1}, head={11:0}, my_malloc(sizeof(*dev1))={0:1}] [L904] dev1 = my_malloc(sizeof(*dev1)) [L905] CALL, EXPR my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={11:0}] [L879] CALL, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={11:0}] [L871] COND TRUE (size > 0) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={11:0}, size=8] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] RET return (void *) guard_malloc_counter; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, \result={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={11:0}, size=8] [L879] EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, __getMemory(size)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={11:0}, size=8] [L879] RET return __getMemory(size); [L905] EXPR my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, elem={0:0}, guard_malloc_counter={0:2}, head={11:0}, my_malloc(sizeof(*dev2))={0:2}] [L905] dev2 = my_malloc(sizeof(*dev2)) [L906] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={11:0}] [L907] CALL list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={11:0}, head={11:0}, new={0:2}] [L890] COND TRUE (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={11:0}, head={11:0}, head={11:0}, new={0:2}, new={0:2}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] RET elem = new VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:2}, guard_malloc_counter={0:2}, head={11:0}, head={11:0}, head={11:0}, new={0:2}, new={0:2}] [L907] list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:2}, guard_malloc_counter={0:2}, head={11:0}] [L908] CALL list_add(dev1, &head) VAL [\old(elem)=2, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:2}, guard_malloc_counter={0:2}, head={11:0}, head={11:0}, new={0:1}] [L890] COND TRUE (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=2, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:2}, guard_malloc_counter={0:2}, head={11:0}, head={11:0}, head={11:0}, new={0:1}, new={0:1}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] RET elem = new VAL [\old(elem)=2, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={11:0}, head={11:0}, head={11:0}, new={0:1}, new={0:1}] [L908] list_add(dev1, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={11:0}] [L909] CALL list_del(dev2) VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, entry={0:2}, guard_malloc_counter={0:2}, head={11:0}] [L896] COND FALSE, RET !(entry==elem) VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, entry={0:2}, entry={0:2}, guard_malloc_counter={0:2}, head={11:0}] [L909] list_del(dev2) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={11:0}] [L910] CALL list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={11:0}, head={11:0}, new={0:2}] [L890] COND TRUE (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={11:0}, head={11:0}, head={11:0}, new={0:2}, new={0:2}] [L891] COND FALSE, RET !(__VERIFIER_nondet_int()) [L910] list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={11:0}] [L913] CALL list_add(dev1, &head) VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={11:0}, head={11:0}, new={0:1}] [L890] COND FALSE !((new!=elem) ? (0) : __blast_assert ()) VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={11:0}, head={11:0}, head={11:0}, new={0:1}, new={0:1}] [L890] CALL __blast_assert () VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={11:0}] [L6] __VERIFIER_error() VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 48 locations, 1 error locations. UNSAFE Result, 94.4s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 64.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 434 SDtfs, 615 SDslu, 4061 SDs, 0 SdLazy, 5194 SolverSat, 546 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 717 GetRequests, 210 SyntacticMatches, 7 SemanticMatches, 500 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4826 ImplicationChecksByTransitivity, 36.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.9s AbstIntTime, 9 AbstIntIterations, 8 AbstIntStrong, 0.9459180751237997 AbsIntWeakeningRatio, 1.5533980582524272 AbsIntAvgWeakeningVarsNumRemoved, 195.80582524271844 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 131 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 629 ConstructedInterpolants, 0 QuantifiedInterpolants, 86414 SizeOfPredicates, 8 NumberOfNonLiveVariables, 319 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 171/230 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...