./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/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 d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-678e011 [2019-11-20 05:42:36,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:42:36,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:42:36,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:42:36,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:42:36,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:42:36,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:42:36,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:42:36,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:42:36,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:42:36,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:42:36,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:42:36,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:42:36,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:42:36,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:42:36,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:42:36,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:42:36,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:42:36,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:42:36,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:42:36,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:42:36,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:42:36,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:42:36,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:42:36,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:42:36,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:42:36,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:42:36,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:42:36,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:42:36,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:42:36,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:42:36,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:42:36,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:42:36,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:42:36,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:42:36,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:42:36,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:42:36,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:42:36,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:42:36,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:42:36,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:42:36,684 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:42:36,696 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:42:36,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:42:36,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:42:36,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:42:36,697 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:42:36,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:42:36,698 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:42:36,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:42:36,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:42:36,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:42:36,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:42:36,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:42:36,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:42:36,699 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:42:36,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:42:36,700 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:42:36,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:42:36,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:42:36,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:42:36,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:42:36,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:42:36,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:42:36,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:42:36,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:42:36,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:42:36,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:42:36,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:42:36,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:42:36,702 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_346620bc-4c0a-4347-ac4b-7b089290f714/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 -> d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 [2019-11-20 05:42:36,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:42:36,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:42:36,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:42:36,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:42:36,890 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:42:36,891 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2019-11-20 05:42:36,941 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/data/a8b4ac7a4/37f44cb169774e6ea2426309b1539568/FLAG73870599a [2019-11-20 05:42:37,439 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:42:37,440 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2019-11-20 05:42:37,451 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/data/a8b4ac7a4/37f44cb169774e6ea2426309b1539568/FLAG73870599a [2019-11-20 05:42:37,915 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/data/a8b4ac7a4/37f44cb169774e6ea2426309b1539568 [2019-11-20 05:42:37,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:42:37,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:42:37,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:42:37,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:42:37,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:42:37,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:42:37" (1/1) ... [2019-11-20 05:42:37,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32390c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:37, skipping insertion in model container [2019-11-20 05:42:37,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:42:37" (1/1) ... [2019-11-20 05:42:37,932 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:42:37,974 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:42:38,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:42:38,301 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:42:38,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:42:38,388 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:42:38,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:38 WrapperNode [2019-11-20 05:42:38,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:42:38,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:42:38,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:42:38,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:42:38,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:38" (1/1) ... [2019-11-20 05:42:38,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:38" (1/1) ... [2019-11-20 05:42:38,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:42:38,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:42:38,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:42:38,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:42:38,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:38" (1/1) ... [2019-11-20 05:42:38,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:38" (1/1) ... [2019-11-20 05:42:38,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:38" (1/1) ... [2019-11-20 05:42:38,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:38" (1/1) ... [2019-11-20 05:42:38,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:38" (1/1) ... [2019-11-20 05:42:38,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:38" (1/1) ... [2019-11-20 05:42:38,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:38" (1/1) ... [2019-11-20 05:42:38,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:42:38,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:42:38,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:42:38,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:42:38,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/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-20 05:42:38,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 05:42:38,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 05:42:38,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 05:42:38,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 05:42:38,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 05:42:38,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 05:42:38,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:42:38,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:42:38,905 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:42:38,906 INFO L285 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-20 05:42:38,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:42:38 BoogieIcfgContainer [2019-11-20 05:42:38,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:42:38,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:42:38,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:42:38,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:42:38,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:42:37" (1/3) ... [2019-11-20 05:42:38,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe14c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:42:38, skipping insertion in model container [2019-11-20 05:42:38,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:42:38" (2/3) ... [2019-11-20 05:42:38,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe14c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:42:38, skipping insertion in model container [2019-11-20 05:42:38,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:42:38" (3/3) ... [2019-11-20 05:42:38,914 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2019-11-20 05:42:38,922 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:42:38,929 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-20 05:42:38,938 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-20 05:42:38,959 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:42:38,960 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:42:38,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:42:38,960 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:42:38,960 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:42:38,961 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:42:38,961 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:42:38,961 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:42:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-11-20 05:42:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 05:42:38,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:42:38,981 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-20 05:42:38,981 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:42:38,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:42:38,986 INFO L82 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2019-11-20 05:42:38,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:42:38,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951956823] [2019-11-20 05:42:38,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:42:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:42:39,123 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-20 05:42:39,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951956823] [2019-11-20 05:42:39,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:42:39,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:42:39,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289162061] [2019-11-20 05:42:39,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 05:42:39,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:42:39,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 05:42:39,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 05:42:39,139 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-11-20 05:42:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:42:39,154 INFO L93 Difference]: Finished difference Result 61 states and 98 transitions. [2019-11-20 05:42:39,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 05:42:39,155 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-20 05:42:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:42:39,162 INFO L225 Difference]: With dead ends: 61 [2019-11-20 05:42:39,162 INFO L226 Difference]: Without dead ends: 27 [2019-11-20 05:42:39,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 05:42:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-20 05:42:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-20 05:42:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 05:42:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-20 05:42:39,198 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2019-11-20 05:42:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:42:39,199 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-20 05:42:39,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 05:42:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-20 05:42:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 05:42:39,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:42:39,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:42:39,200 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:42:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:42:39,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2019-11-20 05:42:39,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:42:39,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161825209] [2019-11-20 05:42:39,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:42:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:42:39,297 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-20 05:42:39,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161825209] [2019-11-20 05:42:39,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:42:39,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:42:39,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691343761] [2019-11-20 05:42:39,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:42:39,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:42:39,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:42:39,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:42:39,300 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2019-11-20 05:42:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:42:39,373 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-11-20 05:42:39,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:42:39,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-20 05:42:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:42:39,374 INFO L225 Difference]: With dead ends: 33 [2019-11-20 05:42:39,374 INFO L226 Difference]: Without dead ends: 31 [2019-11-20 05:42:39,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:42:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-20 05:42:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-11-20 05:42:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 05:42:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-20 05:42:39,380 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2019-11-20 05:42:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:42:39,380 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-20 05:42:39,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:42:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-20 05:42:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 05:42:39,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:42:39,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:42:39,381 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:42:39,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:42:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2019-11-20 05:42:39,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:42:39,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878834073] [2019-11-20 05:42:39,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:42:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:42:39,489 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-20 05:42:39,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878834073] [2019-11-20 05:42:39,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:42:39,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 05:42:39,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995682798] [2019-11-20 05:42:39,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:42:39,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:42:39,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:42:39,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:42:39,491 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-11-20 05:42:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:42:39,636 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-20 05:42:39,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:42:39,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-20 05:42:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:42:39,638 INFO L225 Difference]: With dead ends: 50 [2019-11-20 05:42:39,638 INFO L226 Difference]: Without dead ends: 48 [2019-11-20 05:42:39,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:42:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-20 05:42:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-11-20 05:42:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 05:42:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-20 05:42:39,645 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2019-11-20 05:42:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:42:39,645 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-20 05:42:39,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:42:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-20 05:42:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 05:42:39,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:42:39,648 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:42:39,648 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:42:39,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:42:39,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2019-11-20 05:42:39,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:42:39,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188470661] [2019-11-20 05:42:39,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:42:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:42:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:42:39,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188470661] [2019-11-20 05:42:39,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436236434] [2019-11-20 05:42:39,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:42:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:42:39,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 05:42:40,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:42:40,083 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 05:42:40,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 05:42:40,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:40,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:40,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 05:42:40,104 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:40,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:40,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:42:40,121 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-11-20 05:42:40,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:40,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-20 05:42:40,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:40,282 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-11-20 05:42:40,290 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:42:40,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:40,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:42:40,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2019-11-20 05:42:40,323 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:40,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:40,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:42:40,342 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:24 [2019-11-20 05:42:40,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:40,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-20 05:42:40,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:40,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:40,466 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_27|, |v_#memory_int_28|], 4=[|v_#memory_int_30|]} [2019-11-20 05:42:40,471 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:42:40,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:40,503 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:42:40,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:40,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:42:40,573 INFO L343 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2019-11-20 05:42:40,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2019-11-20 05:42:40,576 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:40,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:40,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 05:42:40,606 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:77, output treesize:40 [2019-11-20 05:42:40,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-11-20 05:42:40,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:40,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:40,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:42:40,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2019-11-20 05:42:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:42:40,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:42:40,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-20 05:42:40,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371576923] [2019-11-20 05:42:40,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 05:42:40,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:42:40,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 05:42:40,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-20 05:42:40,741 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 11 states. [2019-11-20 05:42:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:42:41,392 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2019-11-20 05:42:41,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 05:42:41,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-11-20 05:42:41,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:42:41,395 INFO L225 Difference]: With dead ends: 58 [2019-11-20 05:42:41,395 INFO L226 Difference]: Without dead ends: 56 [2019-11-20 05:42:41,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-11-20 05:42:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-20 05:42:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 23. [2019-11-20 05:42:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 05:42:41,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-11-20 05:42:41,401 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2019-11-20 05:42:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:42:41,401 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-20 05:42:41,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 05:42:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-11-20 05:42:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 05:42:41,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:42:41,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:42:41,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:42:41,602 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:42:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:42:41,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1689639521, now seen corresponding path program 1 times [2019-11-20 05:42:41,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:42:41,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867279422] [2019-11-20 05:42:41,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:42:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:42:41,720 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-20 05:42:41,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867279422] [2019-11-20 05:42:41,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:42:41,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 05:42:41,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224901580] [2019-11-20 05:42:41,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:42:41,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:42:41,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:42:41,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:42:41,722 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2019-11-20 05:42:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:42:41,797 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-11-20 05:42:41,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:42:41,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-20 05:42:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:42:41,799 INFO L225 Difference]: With dead ends: 38 [2019-11-20 05:42:41,799 INFO L226 Difference]: Without dead ends: 26 [2019-11-20 05:42:41,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:42:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-20 05:42:41,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-20 05:42:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 05:42:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-20 05:42:41,803 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2019-11-20 05:42:41,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:42:41,804 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-20 05:42:41,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:42:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-20 05:42:41,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 05:42:41,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:42:41,805 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:42:41,805 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:42:41,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:42:41,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2084817261, now seen corresponding path program 1 times [2019-11-20 05:42:41,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:42:41,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149428557] [2019-11-20 05:42:41,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:42:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:42:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:42:41,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149428557] [2019-11-20 05:42:41,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487305211] [2019-11-20 05:42:41,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:42:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:42:41,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 05:42:41,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:42:41,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:42:42,036 INFO L343 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-11-20 05:42:42,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 48 [2019-11-20 05:42:42,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:42,100 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.4 percent of original size [2019-11-20 05:42:42,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:42:42,147 INFO L343 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-11-20 05:42:42,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 48 [2019-11-20 05:42:42,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:42,195 INFO L567 ElimStorePlain]: treesize reduction 16, result has 79.7 percent of original size [2019-11-20 05:42:42,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:42:42,195 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:63 [2019-11-20 05:42:42,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:42,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:42,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-11-20 05:42:42,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:42,315 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:42,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2019-11-20 05:42:42,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:42,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-11-20 05:42:42,321 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:42,366 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.6 percent of original size [2019-11-20 05:42:42,376 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:42,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2019-11-20 05:42:42,378 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:42,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-11-20 05:42:42,383 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:42,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 05:42:42,389 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:42,402 INFO L567 ElimStorePlain]: treesize reduction 20, result has 25.9 percent of original size [2019-11-20 05:42:42,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:42:42,402 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:110, output treesize:7 [2019-11-20 05:42:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:42:42,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:42:42,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-20 05:42:42,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502619646] [2019-11-20 05:42:42,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:42:42,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:42:42,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:42:42,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:42:42,422 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 8 states. [2019-11-20 05:42:42,563 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-20 05:42:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:42:42,755 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-11-20 05:42:42,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:42:42,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-20 05:42:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:42:42,756 INFO L225 Difference]: With dead ends: 49 [2019-11-20 05:42:42,756 INFO L226 Difference]: Without dead ends: 27 [2019-11-20 05:42:42,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:42:42,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-20 05:42:42,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-20 05:42:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 05:42:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-20 05:42:42,761 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-11-20 05:42:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:42:42,761 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-20 05:42:42,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:42:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-20 05:42:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 05:42:42,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:42:42,762 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:42:42,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:42:42,965 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:42:42,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:42:42,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1088473273, now seen corresponding path program 1 times [2019-11-20 05:42:42,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:42:42,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389294011] [2019-11-20 05:42:42,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:42:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:42:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:42:43,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389294011] [2019-11-20 05:42:43,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060901778] [2019-11-20 05:42:43,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:42:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:42:43,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-20 05:42:43,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:42:43,373 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 05:42:43,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 05:42:43,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:43,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:43,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:42:43,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 [2019-11-20 05:42:43,463 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-11-20 05:42:43,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2019-11-20 05:42:43,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:43,527 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.0 percent of original size [2019-11-20 05:42:43,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 05:42:43,534 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:43,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:43,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 05:42:43,561 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:43,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:43,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:42:43,608 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:58 [2019-11-20 05:42:43,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:43,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 49 [2019-11-20 05:42:43,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:43,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:43,779 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:42:43,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:44,027 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-11-20 05:42:44,027 INFO L343 Elim1Store]: treesize reduction 131, result has 48.2 percent of original size [2019-11-20 05:42:44,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 200 [2019-11-20 05:42:44,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,042 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:44,306 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-11-20 05:42:44,307 INFO L567 ElimStorePlain]: treesize reduction 2916, result has 5.3 percent of original size [2019-11-20 05:42:44,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 125 [2019-11-20 05:42:44,316 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:44,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:44,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:42:44,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 32 [2019-11-20 05:42:44,368 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:44,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:44,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:42:44,397 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:232, output treesize:94 [2019-11-20 05:42:44,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-20 05:42:44,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:44,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:44,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 05:42:44,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:82 [2019-11-20 05:42:44,572 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:44,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 69 [2019-11-20 05:42:44,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:42:44,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:44,592 INFO L567 ElimStorePlain]: treesize reduction 36, result has 20.0 percent of original size [2019-11-20 05:42:44,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:42:44,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:4 [2019-11-20 05:42:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:42:44,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:42:44,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-20 05:42:44,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431433345] [2019-11-20 05:42:44,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 05:42:44,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:42:44,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 05:42:44,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-11-20 05:42:44,600 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 15 states. [2019-11-20 05:42:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:42:45,494 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2019-11-20 05:42:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 05:42:45,494 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2019-11-20 05:42:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:42:45,495 INFO L225 Difference]: With dead ends: 84 [2019-11-20 05:42:45,495 INFO L226 Difference]: Without dead ends: 82 [2019-11-20 05:42:45,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-11-20 05:42:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-20 05:42:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 42. [2019-11-20 05:42:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 05:42:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-11-20 05:42:45,507 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2019-11-20 05:42:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:42:45,508 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-11-20 05:42:45,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 05:42:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-11-20 05:42:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 05:42:45,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:42:45,508 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:42:45,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:42:45,709 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:42:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:42:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash -67404919, now seen corresponding path program 1 times [2019-11-20 05:42:45,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:42:45,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036758819] [2019-11-20 05:42:45,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:42:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:42:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:42:45,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036758819] [2019-11-20 05:42:45,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893058958] [2019-11-20 05:42:45,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:42:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:42:46,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 05:42:46,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:42:46,056 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-20 05:42:46,056 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 05:42:46,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:46,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:42:46,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-11-20 05:42:46,120 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:46,120 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 05:42:46,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:46,141 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 05:42:46,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:46,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 05:42:46,159 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:46,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,171 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:19 [2019-11-20 05:42:46,201 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 2=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|]} [2019-11-20 05:42:46,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-11-20 05:42:46,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:46,231 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:46,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 124 [2019-11-20 05:42:46,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:42:46,233 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,257 INFO L567 ElimStorePlain]: treesize reduction 40, result has 61.9 percent of original size [2019-11-20 05:42:46,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2019-11-20 05:42:46,262 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:46,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,268 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:112, output treesize:26 [2019-11-20 05:42:46,327 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2019-11-20 05:42:46,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:46,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-20 05:42:46,337 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:46,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,343 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:9 [2019-11-20 05:42:46,366 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 05:42:46,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:42:46,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:42:46,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 05:42:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:42:46,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:42:46,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-11-20 05:42:46,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347151492] [2019-11-20 05:42:46,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 05:42:46,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:42:46,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 05:42:46,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-11-20 05:42:46,393 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 18 states. [2019-11-20 05:42:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:42:47,071 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2019-11-20 05:42:47,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 05:42:47,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-11-20 05:42:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:42:47,074 INFO L225 Difference]: With dead ends: 83 [2019-11-20 05:42:47,074 INFO L226 Difference]: Without dead ends: 71 [2019-11-20 05:42:47,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2019-11-20 05:42:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-20 05:42:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2019-11-20 05:42:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 05:42:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-11-20 05:42:47,081 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 20 [2019-11-20 05:42:47,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:42:47,081 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-11-20 05:42:47,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 05:42:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-11-20 05:42:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 05:42:47,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:42:47,082 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:42:47,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:42:47,287 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:42:47,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:42:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash 299800945, now seen corresponding path program 1 times [2019-11-20 05:42:47,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:42:47,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289549292] [2019-11-20 05:42:47,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:42:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:42:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:42:47,358 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 05:42:47,361 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 05:42:47,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:42:47 BoogieIcfgContainer [2019-11-20 05:42:47,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:42:47,411 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:42:47,411 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:42:47,411 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:42:47,412 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:42:38" (3/4) ... [2019-11-20 05:42:47,414 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 05:42:47,471 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_346620bc-4c0a-4347-ac4b-7b089290f714/bin/uautomizer/witness.graphml [2019-11-20 05:42:47,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:42:47,472 INFO L168 Benchmark]: Toolchain (without parser) took 9554.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.6 MB). Free memory was 946.1 MB in the beginning and 976.8 MB in the end (delta: -30.7 MB). Peak memory consumption was 251.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:42:47,473 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:42:47,473 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:42:47,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.37 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:42:47,474 INFO L168 Benchmark]: Boogie Preprocessor took 32.64 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-20 05:42:47,474 INFO L168 Benchmark]: RCFGBuilder took 440.47 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: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:42:47,475 INFO L168 Benchmark]: TraceAbstraction took 8502.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.3 MB). Free memory was 1.1 GB in the beginning and 979.7 MB in the end (delta: 121.6 MB). Peak memory consumption was 246.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:42:47,475 INFO L168 Benchmark]: Witness Printer took 60.37 ms. Allocated memory is still 1.3 GB. Free memory was 979.7 MB in the beginning and 976.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:42:47,479 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 469.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.37 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.64 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 440.47 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: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8502.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.3 MB). Free memory was 1.1 GB in the beginning and 979.7 MB in the end (delta: 121.6 MB). Peak memory consumption was 246.9 MB. Max. memory is 11.5 GB. * Witness Printer took 60.37 ms. Allocated memory is still 1.3 GB. Free memory was 979.7 MB in the beginning and 976.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1039]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] SLL* null = malloc(sizeof(SLL)); [L995] null->colour = BLACK [L996] null->next = ((void*)0) [L998] SLL* list = malloc(sizeof(SLL)); [L999] list->next = null [L1000] list->colour = BLACK [L1002] SLL* end = list; [L1005] COND TRUE __VERIFIER_nondet_int() [L1008] end->next = malloc(sizeof(SLL)) [L1009] EXPR end->next [L1009] end = end->next [L1010] end->next = null [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1018] end->colour = RED [L1019] end->next = malloc(sizeof(SLL)) [L1020] EXPR end->next [L1020] end = end->next [L1021] end->next = null [L1022] end->colour = BLACK [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list [L1030] COND FALSE !(!(null != end)) [L1031] EXPR end->colour [L1031] COND FALSE !(!(BLACK == end->colour)) [L1033] COND TRUE null != end [L1035] EXPR end->colour [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR end->next [L1042] end = end->next [L1033] COND TRUE null != end [L1035] EXPR end->colour [L1035] COND TRUE RED == end->colour [L1037] EXPR end->next [L1037] end = end->next [L1038] COND FALSE !(!(null != end)) [L1039] EXPR end->colour [L1039] COND TRUE !(BLACK != end->colour) [L1039] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 4 error locations. Result: UNSAFE, OverallTime: 8.4s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 201 SDtfs, 328 SDslu, 772 SDs, 0 SdLazy, 847 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 114 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 165 ConstructedInterpolants, 19 QuantifiedInterpolants, 69813 SizeOfPredicates, 48 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 2/24 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...