./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.24-6b5699a [2019-11-25 08:50:47,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:50:47,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:50:47,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:50:47,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:50:47,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:50:47,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:50:47,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:50:47,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:50:47,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:50:47,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:50:47,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:50:47,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:50:47,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:50:47,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:50:47,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:50:47,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:50:47,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:50:47,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:50:47,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:50:47,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:50:47,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:50:47,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:50:47,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:50:47,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:50:47,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:50:47,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:50:47,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:50:47,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:50:47,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:50:47,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:50:47,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:50:47,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:50:47,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:50:47,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:50:47,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:50:47,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:50:47,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:50:47,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:50:47,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:50:47,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:50:47,649 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:50:47,672 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:50:47,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:50:47,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:50:47,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:50:47,684 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:50:47,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:50:47,684 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:50:47,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:50:47,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:50:47,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:50:47,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:50:47,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:50:47,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:50:47,686 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:50:47,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:50:47,687 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:50:47,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:50:47,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:50:47,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:50:47,688 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:50:47,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:50:47,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:50:47,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:50:47,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:50:47,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:50:47,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:50:47,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:50:47,690 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:50:47,690 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f18f7f1f917468e24f0e5d26966f1156107884dd [2019-11-25 08:50:47,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:50:47,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:50:47,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:50:47,852 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:50:47,852 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:50:47,853 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer/../../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2019-11-25 08:50:47,901 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer/data/e1da2af32/c906515537734cbb83b8d577712f1263/FLAG146d0feef [2019-11-25 08:50:48,361 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:50:48,361 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2019-11-25 08:50:48,371 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer/data/e1da2af32/c906515537734cbb83b8d577712f1263/FLAG146d0feef [2019-11-25 08:50:48,383 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer/data/e1da2af32/c906515537734cbb83b8d577712f1263 [2019-11-25 08:50:48,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:50:48,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:50:48,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:48,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:50:48,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:50:48,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:48" (1/1) ... [2019-11-25 08:50:48,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3f07ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48, skipping insertion in model container [2019-11-25 08:50:48,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:48" (1/1) ... [2019-11-25 08:50:48,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:50:48,455 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:50:48,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:48,780 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:50:48,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:48,913 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:50:48,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48 WrapperNode [2019-11-25 08:50:48,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:48,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:48,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:50:48,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:50:48,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48" (1/1) ... [2019-11-25 08:50:48,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48" (1/1) ... [2019-11-25 08:50:48,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:48,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:50:48,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:50:48,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:50:48,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48" (1/1) ... [2019-11-25 08:50:48,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48" (1/1) ... [2019-11-25 08:50:48,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48" (1/1) ... [2019-11-25 08:50:48,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48" (1/1) ... [2019-11-25 08:50:48,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48" (1/1) ... [2019-11-25 08:50:48,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48" (1/1) ... [2019-11-25 08:50:48,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48" (1/1) ... [2019-11-25 08:50:48,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:50:48,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:50:48,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:50:48,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:50:48,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer/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 [2019-11-25 08:50:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:50:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 08:50:49,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:50:49,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:50:49,493 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:50:49,494 INFO L284 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-25 08:50:49,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:49 BoogieIcfgContainer [2019-11-25 08:50:49,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:50:49,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:50:49,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:50:49,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:50:49,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:50:48" (1/3) ... [2019-11-25 08:50:49,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499cc4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:49, skipping insertion in model container [2019-11-25 08:50:49,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:48" (2/3) ... [2019-11-25 08:50:49,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499cc4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:49, skipping insertion in model container [2019-11-25 08:50:49,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:49" (3/3) ... [2019-11-25 08:50:49,502 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2019-11-25 08:50:49,510 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:50:49,517 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-25 08:50:49,526 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-25 08:50:49,548 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:50:49,548 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:50:49,548 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:50:49,548 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:50:49,548 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:50:49,548 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:50:49,548 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:50:49,549 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:50:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-11-25 08:50:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-25 08:50:49,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:49,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-25 08:50:49,569 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:49,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-25 08:50:49,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:49,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435578858] [2019-11-25 08:50:49,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:49,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435578858] [2019-11-25 08:50:49,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:49,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:49,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417817878] [2019-11-25 08:50:49,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:49,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:49,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:49,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:49,730 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2019-11-25 08:50:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:49,760 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-11-25 08:50:49,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:49,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-25 08:50:49,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:49,774 INFO L225 Difference]: With dead ends: 85 [2019-11-25 08:50:49,774 INFO L226 Difference]: Without dead ends: 36 [2019-11-25 08:50:49,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-25 08:50:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-25 08:50:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-25 08:50:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-25 08:50:49,813 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 4 [2019-11-25 08:50:49,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:49,814 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-25 08:50:49,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-25 08:50:49,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:50:49,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:49,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:49,815 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:49,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:49,816 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2019-11-25 08:50:49,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:49,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77527679] [2019-11-25 08:50:49,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:49,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77527679] [2019-11-25 08:50:49,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:49,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:49,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044900611] [2019-11-25 08:50:49,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:49,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:49,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:49,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:49,919 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2019-11-25 08:50:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:50,096 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-11-25 08:50:50,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:50:50,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-25 08:50:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:50,098 INFO L225 Difference]: With dead ends: 64 [2019-11-25 08:50:50,098 INFO L226 Difference]: Without dead ends: 38 [2019-11-25 08:50:50,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:50,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-25 08:50:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-11-25 08:50:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-25 08:50:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-25 08:50:50,105 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 15 [2019-11-25 08:50:50,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:50,106 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-25 08:50:50,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-25 08:50:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:50:50,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:50,107 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:50,107 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:50,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:50,108 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2019-11-25 08:50:50,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:50,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466705327] [2019-11-25 08:50:50,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:50,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466705327] [2019-11-25 08:50:50,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:50,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:50,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229383726] [2019-11-25 08:50:50,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:50:50,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:50,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:50:50,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:50,232 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 7 states. [2019-11-25 08:50:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:50,495 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-25 08:50:50,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:50:50,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-25 08:50:50,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:50,498 INFO L225 Difference]: With dead ends: 54 [2019-11-25 08:50:50,498 INFO L226 Difference]: Without dead ends: 52 [2019-11-25 08:50:50,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:50:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-25 08:50:50,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2019-11-25 08:50:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-25 08:50:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-25 08:50:50,505 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2019-11-25 08:50:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:50,505 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-25 08:50:50,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:50:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-25 08:50:50,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:50:50,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:50,506 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:50,507 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:50,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:50,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1186712674, now seen corresponding path program 1 times [2019-11-25 08:50:50,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:50,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492490916] [2019-11-25 08:50:50,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:50,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492490916] [2019-11-25 08:50:50,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:50,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:50,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968250794] [2019-11-25 08:50:50,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:50,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:50,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:50,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:50,618 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2019-11-25 08:50:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:50,663 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-11-25 08:50:50,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:50:50,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-25 08:50:50,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:50,664 INFO L225 Difference]: With dead ends: 63 [2019-11-25 08:50:50,664 INFO L226 Difference]: Without dead ends: 34 [2019-11-25 08:50:50,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-25 08:50:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-25 08:50:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-25 08:50:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-25 08:50:50,671 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 19 [2019-11-25 08:50:50,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:50,671 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-25 08:50:50,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-25 08:50:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:50:50,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:50,672 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:50,673 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:50,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:50,673 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2019-11-25 08:50:50,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:50,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674506793] [2019-11-25 08:50:50,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:50,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674506793] [2019-11-25 08:50:50,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:50,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 08:50:50,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647558881] [2019-11-25 08:50:50,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:50:50,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:50,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:50:50,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:50:50,826 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 12 states. [2019-11-25 08:50:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:51,242 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-25 08:50:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:50:51,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-25 08:50:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:51,243 INFO L225 Difference]: With dead ends: 50 [2019-11-25 08:50:51,243 INFO L226 Difference]: Without dead ends: 42 [2019-11-25 08:50:51,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-25 08:50:51,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-25 08:50:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-25 08:50:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-25 08:50:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-25 08:50:51,250 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-11-25 08:50:51,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:51,250 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-25 08:50:51,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:50:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-25 08:50:51,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:50:51,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:51,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:51,252 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:51,253 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2019-11-25 08:50:51,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:51,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594248371] [2019-11-25 08:50:51,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:51,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594248371] [2019-11-25 08:50:51,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:51,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:50:51,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601007616] [2019-11-25 08:50:51,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:50:51,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:51,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:50:51,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:50:51,389 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2019-11-25 08:50:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:51,626 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-25 08:50:51,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:50:51,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-25 08:50:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:51,628 INFO L225 Difference]: With dead ends: 54 [2019-11-25 08:50:51,628 INFO L226 Difference]: Without dead ends: 46 [2019-11-25 08:50:51,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:50:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-25 08:50:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-11-25 08:50:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-25 08:50:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-11-25 08:50:51,634 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2019-11-25 08:50:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:51,634 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-11-25 08:50:51,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:50:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-11-25 08:50:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:50:51,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:51,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:51,636 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:51,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:51,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2019-11-25 08:50:51,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:51,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220336539] [2019-11-25 08:50:51,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:51,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220336539] [2019-11-25 08:50:51,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:51,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 08:50:51,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119344342] [2019-11-25 08:50:51,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:50:51,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:51,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:50:51,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:50:51,800 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2019-11-25 08:50:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:52,080 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-11-25 08:50:52,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:50:52,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-25 08:50:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:52,081 INFO L225 Difference]: With dead ends: 56 [2019-11-25 08:50:52,081 INFO L226 Difference]: Without dead ends: 48 [2019-11-25 08:50:52,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-25 08:50:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-25 08:50:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-11-25 08:50:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-25 08:50:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-25 08:50:52,086 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2019-11-25 08:50:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:52,086 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-25 08:50:52,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:50:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-25 08:50:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:50:52,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:52,087 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:52,087 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2019-11-25 08:50:52,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:52,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989606054] [2019-11-25 08:50:52,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:52,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989606054] [2019-11-25 08:50:52,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:52,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-25 08:50:52,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093444256] [2019-11-25 08:50:52,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 08:50:52,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:52,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 08:50:52,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:50:52,218 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 14 states. [2019-11-25 08:50:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:52,688 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-11-25 08:50:52,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-25 08:50:52,688 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-11-25 08:50:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:52,689 INFO L225 Difference]: With dead ends: 55 [2019-11-25 08:50:52,689 INFO L226 Difference]: Without dead ends: 53 [2019-11-25 08:50:52,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2019-11-25 08:50:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-25 08:50:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-11-25 08:50:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-25 08:50:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-25 08:50:52,694 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 25 [2019-11-25 08:50:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:52,694 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-25 08:50:52,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 08:50:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-25 08:50:52,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:50:52,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:52,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:52,696 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:52,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:52,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2019-11-25 08:50:52,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:52,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351704345] [2019-11-25 08:50:52,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:52,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351704345] [2019-11-25 08:50:52,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:52,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:52,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608933029] [2019-11-25 08:50:52,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:52,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:52,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:52,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:52,776 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-11-25 08:50:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:52,828 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-25 08:50:52,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:50:52,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-25 08:50:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:52,831 INFO L225 Difference]: With dead ends: 46 [2019-11-25 08:50:52,831 INFO L226 Difference]: Without dead ends: 42 [2019-11-25 08:50:52,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-25 08:50:52,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-25 08:50:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-25 08:50:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-25 08:50:52,836 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2019-11-25 08:50:52,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:52,837 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-25 08:50:52,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:52,837 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-25 08:50:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:50:52,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:52,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:52,838 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:52,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:52,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1400103152, now seen corresponding path program 1 times [2019-11-25 08:50:52,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:52,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660239577] [2019-11-25 08:50:52,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:52,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660239577] [2019-11-25 08:50:52,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:52,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-25 08:50:52,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489180055] [2019-11-25 08:50:52,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 08:50:52,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:52,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:50:52,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:50:52,946 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2019-11-25 08:50:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:53,388 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-11-25 08:50:53,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:50:53,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-25 08:50:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:53,389 INFO L225 Difference]: With dead ends: 50 [2019-11-25 08:50:53,389 INFO L226 Difference]: Without dead ends: 48 [2019-11-25 08:50:53,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2019-11-25 08:50:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-25 08:50:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2019-11-25 08:50:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-25 08:50:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-25 08:50:53,394 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2019-11-25 08:50:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:53,394 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-25 08:50:53,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 08:50:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-25 08:50:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:50:53,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:53,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:53,395 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:53,396 INFO L82 PathProgramCache]: Analyzing trace with hash 758876958, now seen corresponding path program 1 times [2019-11-25 08:50:53,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:53,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313731555] [2019-11-25 08:50:53,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:53,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313731555] [2019-11-25 08:50:53,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:53,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:50:53,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115800045] [2019-11-25 08:50:53,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:50:53,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:53,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:50:53,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:50:53,525 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2019-11-25 08:50:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:53,685 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-11-25 08:50:53,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:50:53,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-25 08:50:53,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:53,686 INFO L225 Difference]: With dead ends: 44 [2019-11-25 08:50:53,686 INFO L226 Difference]: Without dead ends: 34 [2019-11-25 08:50:53,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:50:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-25 08:50:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-25 08:50:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-25 08:50:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-11-25 08:50:53,690 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 29 [2019-11-25 08:50:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:53,690 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-11-25 08:50:53,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:50:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-11-25 08:50:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:50:53,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:53,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:53,691 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:53,692 INFO L82 PathProgramCache]: Analyzing trace with hash -50469668, now seen corresponding path program 1 times [2019-11-25 08:50:53,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:53,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621155825] [2019-11-25 08:50:53,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:53,759 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:53,760 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:50:53,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:50:53 BoogieIcfgContainer [2019-11-25 08:50:53,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:50:53,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:50:53,815 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:50:53,816 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:50:53,816 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:49" (3/4) ... [2019-11-25 08:50:53,818 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:50:53,872 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c588547f-8afc-46df-aee0-569fae74913e/bin/uautomizer/witness.graphml [2019-11-25 08:50:53,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:50:53,874 INFO L168 Benchmark]: Toolchain (without parser) took 5486.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:53,875 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:53,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:53,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.00 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:53,876 INFO L168 Benchmark]: Boogie Preprocessor took 32.19 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. [2019-11-25 08:50:53,876 INFO L168 Benchmark]: RCFGBuilder took 503.29 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:53,877 INFO L168 Benchmark]: TraceAbstraction took 4319.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:53,877 INFO L168 Benchmark]: Witness Printer took 57.11 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:53,880 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 525.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.00 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.19 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 503.29 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4319.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Witness Printer took 57.11 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * 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] static struct list_head head; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L903] struct list_head *dev1, *dev2; [L871] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] return (void *) guard_malloc_counter; VAL [elem={0:0}, guard_malloc_counter={0:1}, head={3:0}] [L879] return __getMemory(size); [L904] dev1 = my_malloc(sizeof(*dev1)) [L871] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:1}, head={3:0}] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] return (void *) guard_malloc_counter; VAL [elem={0:0}, guard_malloc_counter={0:2}, head={3:0}] [L879] return __getMemory(size); [L905] dev2 = my_malloc(sizeof(*dev2)) [L906] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:2}, head={3:0}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] elem = new VAL [elem={0:2}, guard_malloc_counter={0:2}, head={3:0}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:2}, guard_malloc_counter={0:2}, head={3:0}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] elem = new VAL [elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L896] COND FALSE !(entry==elem) VAL [elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L891] COND FALSE !(__VERIFIER_nondet_int()) [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L6] __VERIFIER_error() VAL [elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 6 error locations. Result: UNSAFE, OverallTime: 4.2s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 316 SDtfs, 1037 SDslu, 725 SDs, 0 SdLazy, 1052 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 19201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...