./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-10-22 08:58:09,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:09,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:09,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:09,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:09,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:09,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:09,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:09,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:09,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:09,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:09,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:09,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:09,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:09,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:09,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:09,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:09,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:09,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:09,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:09,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:09,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:09,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:09,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:09,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:09,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:09,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:09,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:09,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:09,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:09,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:09,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:09,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:09,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:09,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:09,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:09,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:09,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:09,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:09,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:09,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:09,725 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:58:09,737 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:09,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:09,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:09,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:09,739 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:09,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:09,739 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:09,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:09,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:09,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:09,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:58:09,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:58:09,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:58:09,740 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:09,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:09,740 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:09,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:58:09,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:09,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:09,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:58:09,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:58:09,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:58:09,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:09,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:58:09,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:58:09,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:09,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:58:09,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:58:09,743 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/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2019-10-22 08:58:09,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:09,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:09,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:09,780 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:09,781 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:09,781 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-10-22 08:58:09,831 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/bin/uautomizer/data/c6121f167/219f2e3f60eb434388f888186aa56875/FLAG57f2c529f [2019-10-22 08:58:10,261 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:10,265 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-10-22 08:58:10,277 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/bin/uautomizer/data/c6121f167/219f2e3f60eb434388f888186aa56875/FLAG57f2c529f [2019-10-22 08:58:10,577 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/bin/uautomizer/data/c6121f167/219f2e3f60eb434388f888186aa56875 [2019-10-22 08:58:10,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:10,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:10,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:10,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:10,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:10,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:10" (1/1) ... [2019-10-22 08:58:10,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34749b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:10, skipping insertion in model container [2019-10-22 08:58:10,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:10" (1/1) ... [2019-10-22 08:58:10,595 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:10,635 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:11,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:11,026 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:11,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:11,115 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:11,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:11 WrapperNode [2019-10-22 08:58:11,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:11,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:11,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:11,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:11,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:11" (1/1) ... [2019-10-22 08:58:11,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:11" (1/1) ... [2019-10-22 08:58:11,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:11,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:11,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:11,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:11,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:11" (1/1) ... [2019-10-22 08:58:11,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:11" (1/1) ... [2019-10-22 08:58:11,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:11" (1/1) ... [2019-10-22 08:58:11,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:11" (1/1) ... [2019-10-22 08:58:11,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:11" (1/1) ... [2019-10-22 08:58:11,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:11" (1/1) ... [2019-10-22 08:58:11,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:11" (1/1) ... [2019-10-22 08:58:11,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:11,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:11,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:11,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:11,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/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-10-22 08:58:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:58:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:58:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:58:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:11,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:11,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:11,704 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:11,704 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-10-22 08:58:11,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:11 BoogieIcfgContainer [2019-10-22 08:58:11,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:11,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:58:11,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:58:11,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:58:11,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:58:10" (1/3) ... [2019-10-22 08:58:11,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498b73bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:11, skipping insertion in model container [2019-10-22 08:58:11,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:11" (2/3) ... [2019-10-22 08:58:11,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498b73bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:11, skipping insertion in model container [2019-10-22 08:58:11,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:11" (3/3) ... [2019-10-22 08:58:11,714 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2019-10-22 08:58:11,722 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:58:11,729 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-22 08:58:11,739 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-22 08:58:11,763 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:58:11,763 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:58:11,763 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:58:11,763 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:11,763 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:11,764 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:58:11,764 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:11,764 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:58:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-22 08:58:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 08:58:11,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:11,790 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:11,791 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:11,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:11,795 INFO L82 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2019-10-22 08:58:11,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:11,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518100506] [2019-10-22 08:58:11,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:11,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:11,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:11,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518100506] [2019-10-22 08:58:11,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:11,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:11,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785095595] [2019-10-22 08:58:11,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 08:58:11,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:11,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:58:11,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:58:11,943 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-22 08:58:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:11,961 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2019-10-22 08:58:11,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:58:11,962 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 08:58:11,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:11,972 INFO L225 Difference]: With dead ends: 92 [2019-10-22 08:58:11,973 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 08:58:11,976 INFO L600 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-10-22 08:58:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 08:58:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-22 08:58:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 08:58:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-10-22 08:58:12,018 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2019-10-22 08:58:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:12,020 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-10-22 08:58:12,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 08:58:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-10-22 08:58:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 08:58:12,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:12,021 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:12,021 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:12,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:12,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2019-10-22 08:58:12,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:12,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097896075] [2019-10-22 08:58:12,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:12,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097896075] [2019-10-22 08:58:12,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:12,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:12,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781532802] [2019-10-22 08:58:12,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:12,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:12,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:12,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:12,132 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-10-22 08:58:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:12,240 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-10-22 08:58:12,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:12,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 08:58:12,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:12,242 INFO L225 Difference]: With dead ends: 47 [2019-10-22 08:58:12,242 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 08:58:12,243 INFO L600 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-10-22 08:58:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 08:58:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-10-22 08:58:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 08:58:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-10-22 08:58:12,247 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2019-10-22 08:58:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:12,248 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-10-22 08:58:12,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-10-22 08:58:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 08:58:12,248 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:12,249 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:12,249 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2019-10-22 08:58:12,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:12,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928477244] [2019-10-22 08:58:12,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:12,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928477244] [2019-10-22 08:58:12,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:12,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:12,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417152779] [2019-10-22 08:58:12,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:12,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:12,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:12,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:12,363 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-10-22 08:58:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:12,449 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-10-22 08:58:12,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:12,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 08:58:12,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:12,452 INFO L225 Difference]: With dead ends: 39 [2019-10-22 08:58:12,452 INFO L226 Difference]: Without dead ends: 37 [2019-10-22 08:58:12,452 INFO L600 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-10-22 08:58:12,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-22 08:58:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-22 08:58:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 08:58:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-10-22 08:58:12,462 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2019-10-22 08:58:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:12,462 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-10-22 08:58:12,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-10-22 08:58:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:58:12,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:12,463 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:12,463 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:12,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:12,464 INFO L82 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2019-10-22 08:58:12,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:12,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842999741] [2019-10-22 08:58:12,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:12,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842999741] [2019-10-22 08:58:12,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:12,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:58:12,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974134644] [2019-10-22 08:58:12,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:58:12,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:12,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:58:12,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:58:12,606 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2019-10-22 08:58:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:12,843 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-22 08:58:12,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:12,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-10-22 08:58:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:12,844 INFO L225 Difference]: With dead ends: 78 [2019-10-22 08:58:12,844 INFO L226 Difference]: Without dead ends: 76 [2019-10-22 08:58:12,845 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:58:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-22 08:58:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-10-22 08:58:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 08:58:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-10-22 08:58:12,851 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 10 [2019-10-22 08:58:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:12,852 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-10-22 08:58:12,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:58:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-10-22 08:58:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 08:58:12,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:12,852 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:12,853 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2019-10-22 08:58:12,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:12,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640039266] [2019-10-22 08:58:12,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:12,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640039266] [2019-10-22 08:58:12,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:12,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:12,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231554573] [2019-10-22 08:58:12,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:12,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:12,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:12,923 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2019-10-22 08:58:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:13,035 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-10-22 08:58:13,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:13,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 08:58:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:13,037 INFO L225 Difference]: With dead ends: 55 [2019-10-22 08:58:13,037 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 08:58:13,038 INFO L600 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-10-22 08:58:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 08:58:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-22 08:58:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 08:58:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-10-22 08:58:13,047 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 11 [2019-10-22 08:58:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:13,048 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-10-22 08:58:13,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-10-22 08:58:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 08:58:13,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:13,048 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:13,049 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:13,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:13,049 INFO L82 PathProgramCache]: Analyzing trace with hash -688119236, now seen corresponding path program 1 times [2019-10-22 08:58:13,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:13,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525520060] [2019-10-22 08:58:13,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:13,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525520060] [2019-10-22 08:58:13,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:13,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:13,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313172042] [2019-10-22 08:58:13,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:13,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:13,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:13,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:13,157 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2019-10-22 08:58:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:13,223 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-10-22 08:58:13,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:13,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-22 08:58:13,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:13,225 INFO L225 Difference]: With dead ends: 53 [2019-10-22 08:58:13,225 INFO L226 Difference]: Without dead ends: 51 [2019-10-22 08:58:13,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-22 08:58:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-22 08:58:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 08:58:13,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-10-22 08:58:13,235 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 13 [2019-10-22 08:58:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:13,235 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-10-22 08:58:13,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-10-22 08:58:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 08:58:13,236 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:13,236 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:13,236 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2019-10-22 08:58:13,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:13,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016507409] [2019-10-22 08:58:13,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:13,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016507409] [2019-10-22 08:58:13,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:13,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:13,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181589432] [2019-10-22 08:58:13,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:13,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:13,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:13,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:13,361 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2019-10-22 08:58:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:13,472 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2019-10-22 08:58:13,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:13,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 08:58:13,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:13,474 INFO L225 Difference]: With dead ends: 66 [2019-10-22 08:58:13,474 INFO L226 Difference]: Without dead ends: 54 [2019-10-22 08:58:13,475 INFO L600 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-10-22 08:58:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-22 08:58:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-10-22 08:58:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 08:58:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-10-22 08:58:13,483 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 14 [2019-10-22 08:58:13,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:13,484 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-10-22 08:58:13,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-10-22 08:58:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 08:58:13,485 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:13,486 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:13,486 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:13,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:13,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2019-10-22 08:58:13,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:13,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595864042] [2019-10-22 08:58:13,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:13,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595864042] [2019-10-22 08:58:13,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546226264] [2019-10-22 08:58:13,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/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-10-22 08:58:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:58:13,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:13,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:13,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:13,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:13,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-22 08:58:13,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:13,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:13,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:13,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:13,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:13,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-22 08:58:13,711 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:13,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:13,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:13,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-10-22 08:58:13,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:13,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-10-22 08:58:13,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:13,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:13,788 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-22 08:58:13,789 INFO L375 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 24 treesize of output 10 [2019-10-22 08:58:13,789 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:13,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:13,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:13,796 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-10-22 08:58:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:13,800 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:13,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-10-22 08:58:13,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266960288] [2019-10-22 08:58:13,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:13,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:13,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:13,802 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 7 states. [2019-10-22 08:58:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:13,983 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-10-22 08:58:13,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:58:13,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-10-22 08:58:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:13,987 INFO L225 Difference]: With dead ends: 75 [2019-10-22 08:58:13,987 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 08:58:13,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:58:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 08:58:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-22 08:58:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 08:58:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-10-22 08:58:13,993 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 17 [2019-10-22 08:58:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:13,993 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-10-22 08:58:13,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-10-22 08:58:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:58:13,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:13,994 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:14,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:14,195 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1036168340, now seen corresponding path program 1 times [2019-10-22 08:58:14,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:14,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737024443] [2019-10-22 08:58:14,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:14,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737024443] [2019-10-22 08:58:14,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9628395] [2019-10-22 08:58:14,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/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-10-22 08:58:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:14,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-22 08:58:14,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:14,577 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-22 08:58:14,578 INFO L375 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-10-22 08:58:14,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:14,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:14,599 INFO L375 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-10-22 08:58:14,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:14,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:14,616 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-10-22 08:58:14,616 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-10-22 08:58:14,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:14,708 INFO L375 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-10-22 08:58:14,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:14,813 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2019-10-22 08:58:14,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:14,821 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:14,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:14,856 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:58:14,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:14,886 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:58:14,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:14,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:14,927 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:14,927 INFO L375 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 1 case distinctions, treesize of input 77 treesize of output 55 [2019-10-22 08:58:14,928 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:14,973 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.2 percent of original size [2019-10-22 08:58:14,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:14,975 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:111, output treesize:24 [2019-10-22 08:58:15,025 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:15,026 INFO L375 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-10-22 08:58:15,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:15,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:15,075 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_28|, |v_#memory_int_37|, |v_#memory_int_38|, |v_#memory_int_39|], 4=[|v_#memory_int_41|]} [2019-10-22 08:58:15,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:15,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:15,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:15,121 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:58:15,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:15,153 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:58:15,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:15,178 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:58:15,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:15,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:15,248 INFO L341 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2019-10-22 08:58:15,249 INFO L375 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 3 case distinctions, treesize of input 57 treesize of output 85 [2019-10-22 08:58:15,250 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:15,307 INFO L567 ElimStorePlain]: treesize reduction 18, result has 80.9 percent of original size [2019-10-22 08:58:15,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 08:58:15,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 08:58:15,317 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:246, output treesize:40 [2019-10-22 08:58:15,408 INFO L375 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-10-22 08:58:15,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:15,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:15,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:15,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2019-10-22 08:58:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:15,420 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:15,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-10-22 08:58:15,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137698638] [2019-10-22 08:58:15,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 08:58:15,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:15,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:58:15,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:58:15,422 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 12 states. [2019-10-22 08:58:15,897 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-10-22 08:58:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:16,279 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-10-22 08:58:16,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:58:16,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-10-22 08:58:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:16,280 INFO L225 Difference]: With dead ends: 85 [2019-10-22 08:58:16,280 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 08:58:16,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:58:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 08:58:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 35. [2019-10-22 08:58:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 08:58:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-10-22 08:58:16,285 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2019-10-22 08:58:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:16,285 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-10-22 08:58:16,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 08:58:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-10-22 08:58:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 08:58:16,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:16,286 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:16,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:16,487 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:16,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1438350182, now seen corresponding path program 1 times [2019-10-22 08:58:16,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:16,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138231370] [2019-10-22 08:58:16,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:16,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138231370] [2019-10-22 08:58:16,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286147570] [2019-10-22 08:58:16,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/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-10-22 08:58:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-22 08:58:16,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:16,923 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-22 08:58:16,923 INFO L375 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-10-22 08:58:16,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:16,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:16,933 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-10-22 08:58:16,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-22 08:58:16,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:16,970 INFO L375 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-10-22 08:58:16,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:17,062 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-10-22 08:58:17,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:17,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:17,071 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 08:58:17,095 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:17,095 INFO L375 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 63 treesize of output 41 [2019-10-22 08:58:17,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:17,164 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-10-22 08:58:17,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:17,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:17,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:17,183 INFO L375 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 1 case distinctions, treesize of input 63 treesize of output 41 [2019-10-22 08:58:17,183 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:17,235 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-22 08:58:17,236 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-10-22 08:58:17,236 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:66 [2019-10-22 08:58:17,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:17,332 INFO L375 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 20 treesize of output 30 [2019-10-22 08:58:17,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:17,587 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-22 08:58:17,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:17,589 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_32|, |v_#memory_$Pointer$.offset_30|], 11=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_30|]} [2019-10-22 08:58:17,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:17,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 433 treesize of output 289 [2019-10-22 08:58:17,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:17,830 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-22 08:58:17,830 INFO L567 ElimStorePlain]: treesize reduction 24, result has 94.6 percent of original size [2019-10-22 08:58:17,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-10-22 08:58:17,869 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:17,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:17,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:17,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:17,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:17,943 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 08:58:17,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:17,974 INFO L341 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2019-10-22 08:58:17,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 97 [2019-10-22 08:58:17,975 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:18,087 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-10-22 08:58:18,088 INFO L567 ElimStorePlain]: treesize reduction 41, result has 86.4 percent of original size [2019-10-22 08:58:18,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:18,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:18,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:18,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 174 treesize of output 144 [2019-10-22 08:58:18,146 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:18,275 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-10-22 08:58:18,275 INFO L567 ElimStorePlain]: treesize reduction 134, result has 42.7 percent of original size [2019-10-22 08:58:18,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:18,276 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:457, output treesize:97 [2019-10-22 08:58:18,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:18,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:18,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:18,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 19 [2019-10-22 08:58:18,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:18,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:18,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:58:18,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:138, output treesize:75 [2019-10-22 08:58:18,666 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:18,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 85 treesize of output 86 [2019-10-22 08:58:18,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:18,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:18,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:18,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:18,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:18,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:18,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:18,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:4 [2019-10-22 08:58:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:18,697 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:18,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-10-22 08:58:18,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629405552] [2019-10-22 08:58:18,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-22 08:58:18,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:18,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 08:58:18,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-22 08:58:18,699 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 20 states. [2019-10-22 08:58:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:19,760 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2019-10-22 08:58:19,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-22 08:58:19,760 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-10-22 08:58:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:19,761 INFO L225 Difference]: With dead ends: 117 [2019-10-22 08:58:19,761 INFO L226 Difference]: Without dead ends: 115 [2019-10-22 08:58:19,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2019-10-22 08:58:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-22 08:58:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 69. [2019-10-22 08:58:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 08:58:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2019-10-22 08:58:19,769 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 28 [2019-10-22 08:58:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:19,769 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2019-10-22 08:58:19,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-22 08:58:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2019-10-22 08:58:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 08:58:19,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:19,770 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:19,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:19,971 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:19,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1572363688, now seen corresponding path program 1 times [2019-10-22 08:58:19,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666417603] [2019-10-22 08:58:19,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:20,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666417603] [2019-10-22 08:58:20,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86006486] [2019-10-22 08:58:20,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/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-10-22 08:58:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-22 08:58:20,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:20,611 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-22 08:58:20,611 INFO L375 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-10-22 08:58:20,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:20,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:20,619 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-10-22 08:58:20,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-10-22 08:58:20,671 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:20,672 INFO L375 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-10-22 08:58:20,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:20,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:20,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:20,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:20,712 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 08:58:20,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:20,723 INFO L375 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 67 treesize of output 49 [2019-10-22 08:58:20,723 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:20,764 INFO L567 ElimStorePlain]: treesize reduction 22, result has 85.2 percent of original size [2019-10-22 08:58:20,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:20,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:20,781 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:20,782 INFO L375 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 1 case distinctions, treesize of input 67 treesize of output 51 [2019-10-22 08:58:20,782 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:20,813 INFO L567 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-10-22 08:58:20,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:20,814 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:203, output treesize:45 [2019-10-22 08:58:20,847 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_32|]} [2019-10-22 08:58:20,852 INFO L375 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-10-22 08:58:20,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:20,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:20,914 INFO L341 Elim1Store]: treesize reduction 74, result has 47.5 percent of original size [2019-10-22 08:58:20,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 153 [2019-10-22 08:58:20,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:20,916 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:20,945 INFO L567 ElimStorePlain]: treesize reduction 40, result has 71.2 percent of original size [2019-10-22 08:58:20,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:20,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 109 [2019-10-22 08:58:20,961 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:20,982 INFO L567 ElimStorePlain]: treesize reduction 64, result has 48.4 percent of original size [2019-10-22 08:58:20,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:20,983 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:146, output treesize:60 [2019-10-22 08:58:21,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:21,075 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2019-10-22 08:58:21,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:21,088 INFO L567 ElimStorePlain]: treesize reduction 18, result has 67.9 percent of original size [2019-10-22 08:58:21,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-22 08:58:21,092 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:21,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:21,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:21,096 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:9 [2019-10-22 08:58:21,114 INFO L375 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-10-22 08:58:21,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:21,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:21,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:21,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-22 08:58:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:21,134 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:21,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-10-22 08:58:21,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136123531] [2019-10-22 08:58:21,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-22 08:58:21,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:21,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-22 08:58:21,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-10-22 08:58:21,136 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 21 states. [2019-10-22 08:58:21,703 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2019-10-22 08:58:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:22,866 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2019-10-22 08:58:22,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 08:58:22,866 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-10-22 08:58:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:22,868 INFO L225 Difference]: With dead ends: 127 [2019-10-22 08:58:22,868 INFO L226 Difference]: Without dead ends: 115 [2019-10-22 08:58:22,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2019-10-22 08:58:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-22 08:58:22,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 78. [2019-10-22 08:58:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 08:58:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-10-22 08:58:22,884 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 28 [2019-10-22 08:58:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:22,885 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-10-22 08:58:22,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-22 08:58:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-10-22 08:58:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 08:58:22,885 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:22,885 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:23,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:23,090 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:23,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:23,091 INFO L82 PathProgramCache]: Analyzing trace with hash 120690651, now seen corresponding path program 2 times [2019-10-22 08:58:23,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:23,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354680611] [2019-10-22 08:58:23,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:23,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:23,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:23,462 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-10-22 08:58:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:24,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354680611] [2019-10-22 08:58:24,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460752272] [2019-10-22 08:58:24,029 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:24,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:58:24,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:58:24,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-22 08:58:24,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:24,128 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-22 08:58:24,129 INFO L375 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-10-22 08:58:24,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:24,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:24,138 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-10-22 08:58:24,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-10-22 08:58:24,169 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:24,169 INFO L375 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-10-22 08:58:24,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:24,288 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-22 08:58:24,288 INFO L567 ElimStorePlain]: treesize reduction 18, result has 91.8 percent of original size [2019-10-22 08:58:24,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:24,300 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 08:58:24,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:24,311 INFO L375 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 1 case distinctions, treesize of input 63 treesize of output 41 [2019-10-22 08:58:24,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:24,358 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-10-22 08:58:24,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:24,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:24,370 INFO L375 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 63 treesize of output 41 [2019-10-22 08:58:24,371 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:24,423 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-22 08:58:24,424 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-10-22 08:58:24,424 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:66 [2019-10-22 08:58:24,565 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:24,565 INFO L375 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 20 treesize of output 30 [2019-10-22 08:58:24,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:25,342 WARN L191 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 102 [2019-10-22 08:58:25,343 INFO L567 ElimStorePlain]: treesize reduction 4, result has 99.7 percent of original size [2019-10-22 08:58:25,345 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_45|, |v_#memory_int_46|], 2=[|v_#memory_int_44|, |v_#memory_int_43|], 6=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_35|], 11=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_33|]} [2019-10-22 08:58:25,355 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:58:25,644 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-10-22 08:58:25,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:25,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2019-10-22 08:58:25,705 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:25,949 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-10-22 08:58:25,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:25,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:25,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 29 [2019-10-22 08:58:25,988 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:26,152 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-10-22 08:58:26,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:26,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:26,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 138 [2019-10-22 08:58:26,173 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:26,436 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-10-22 08:58:26,437 INFO L567 ElimStorePlain]: treesize reduction 8, result has 99.3 percent of original size [2019-10-22 08:58:26,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:26,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1047 treesize of output 635 [2019-10-22 08:58:26,455 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:26,782 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-10-22 08:58:26,783 INFO L567 ElimStorePlain]: treesize reduction 24, result has 97.7 percent of original size [2019-10-22 08:58:26,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-10-22 08:58:26,821 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:26,983 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-22 08:58:26,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:27,150 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-10-22 08:58:27,151 INFO L341 Elim1Store]: treesize reduction 151, result has 60.6 percent of original size [2019-10-22 08:58:27,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 535 treesize of output 537 [2019-10-22 08:58:27,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:27,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:27,156 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:27,248 INFO L567 ElimStorePlain]: treesize reduction 883, result has 28.4 percent of original size [2019-10-22 08:58:27,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:27,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:27,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:27,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 60 [2019-10-22 08:58:27,257 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:27,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:27,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:27,275 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:1422, output treesize:131 [2019-10-22 08:58:27,355 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 4=[|#memory_$Pointer$.offset|]} [2019-10-22 08:58:27,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:27,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 78 [2019-10-22 08:58:27,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:27,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:27,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:27,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:27,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:27,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:27,371 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:58:27,412 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.4 percent of original size [2019-10-22 08:58:27,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:58:27,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2019-10-22 08:58:27,417 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:27,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:27,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:58:27,423 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:18 [2019-10-22 08:58:27,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:27,461 INFO L375 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 22 treesize of output 18 [2019-10-22 08:58:27,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:27,474 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-10-22 08:58:27,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:27,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-10-22 08:58:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:27,504 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:27,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 20 [2019-10-22 08:58:27,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661136466] [2019-10-22 08:58:27,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-22 08:58:27,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 08:58:27,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-10-22 08:58:27,505 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 20 states. [2019-10-22 08:58:27,965 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-10-22 08:58:28,254 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-10-22 08:58:28,699 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 79 [2019-10-22 08:58:29,089 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-10-22 08:58:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:29,970 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2019-10-22 08:58:29,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-22 08:58:29,970 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-10-22 08:58:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:29,971 INFO L225 Difference]: With dead ends: 151 [2019-10-22 08:58:29,971 INFO L226 Difference]: Without dead ends: 139 [2019-10-22 08:58:29,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=301, Invalid=1339, Unknown=0, NotChecked=0, Total=1640 [2019-10-22 08:58:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-22 08:58:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 102. [2019-10-22 08:58:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-22 08:58:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2019-10-22 08:58:29,982 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 31 [2019-10-22 08:58:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:29,982 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2019-10-22 08:58:29,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-22 08:58:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2019-10-22 08:58:29,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 08:58:29,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:29,983 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:30,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:30,184 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:30,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:30,184 INFO L82 PathProgramCache]: Analyzing trace with hash -994395513, now seen corresponding path program 1 times [2019-10-22 08:58:30,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:30,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519919703] [2019-10-22 08:58:30,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:30,255 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:30,255 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:58:30,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:58:30 BoogieIcfgContainer [2019-10-22 08:58:30,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:58:30,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:30,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:30,302 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:30,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:11" (3/4) ... [2019-10-22 08:58:30,306 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:58:30,360 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a2b5fe22-ef76-4850-ad4a-40c0ceec4467/bin/uautomizer/witness.graphml [2019-10-22 08:58:30,363 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:30,364 INFO L168 Benchmark]: Toolchain (without parser) took 19783.59 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 345.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:30,364 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:30,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:30,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:30,364 INFO L168 Benchmark]: Boogie Preprocessor took 39.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:30,365 INFO L168 Benchmark]: RCFGBuilder took 506.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:30,365 INFO L168 Benchmark]: TraceAbstraction took 18594.19 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -104.1 MB). Peak memory consumption was 134.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:30,365 INFO L168 Benchmark]: Witness Printer took 61.03 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:30,366 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 534.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 506.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18594.19 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -104.1 MB). Peak memory consumption was 134.5 MB. Max. memory is 11.5 GB. * Witness Printer took 61.03 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR end->next [L1004] end->next->prev = end [L1005] EXPR end->next [L1005] end = end->next [L1006] end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] end->colour = RED [L1015] end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR end->next [L1016] end->next->prev = end [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = null [L1019] end->colour = BLACK [L1021] EXPR end->colour [L1021] COND FALSE !(!(BLACK == end->colour)) [L1022] EXPR end->next [L1022] COND FALSE !(!(null == end->next)) [L1023] COND FALSE !(!(null != end)) [L1000] 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)) [L1032] COND TRUE null != end [L1034] EXPR end->colour [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR end->colour [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) [L1038] EXPR end->colour [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 7 error locations. Result: UNSAFE, OverallTime: 18.5s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 375 SDtfs, 1097 SDslu, 1397 SDs, 0 SdLazy, 1647 SolverSat, 294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 111 SyntacticMatches, 13 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 196 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 302 ConstructedInterpolants, 29 QuantifiedInterpolants, 296787 SizeOfPredicates, 70 NumberOfNonLiveVariables, 602 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 7/42 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...