./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/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 7b225e80ee922ecd6d28f97f9a97339f737a7de4 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:22:15,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:22:15,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:22:15,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:22:15,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:22:15,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:22:15,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:22:15,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:22:15,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:22:15,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:22:15,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:22:15,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:22:15,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:22:15,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:22:15,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:22:15,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:22:15,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:22:15,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:22:15,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:22:15,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:22:15,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:22:15,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:22:15,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:22:15,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:22:15,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:22:15,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:22:15,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:22:15,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:22:15,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:22:15,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:22:15,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:22:15,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:22:15,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:22:15,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:22:15,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:22:15,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:22:15,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:22:15,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:22:15,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:22:15,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:22:15,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:22:15,415 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:22:15,428 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:22:15,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:22:15,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:22:15,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:22:15,429 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:22:15,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:22:15,430 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:22:15,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:22:15,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:22:15,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:22:15,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:22:15,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:22:15,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:22:15,431 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:22:15,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:22:15,431 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:22:15,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:22:15,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:22:15,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:22:15,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:22:15,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:22:15,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:22:15,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:22:15,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:22:15,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:22:15,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:22:15,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:22:15,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:22:15,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/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 -> 7b225e80ee922ecd6d28f97f9a97339f737a7de4 [2019-11-20 00:22:15,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:22:15,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:22:15,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:22:15,591 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:22:15,591 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:22:15,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2019-11-20 00:22:15,645 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/data/7cf1a3a1c/953b61a81f9b4e2c87dde48a5a0061ea/FLAG3c26665dd [2019-11-20 00:22:16,046 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:22:16,047 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2019-11-20 00:22:16,054 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/data/7cf1a3a1c/953b61a81f9b4e2c87dde48a5a0061ea/FLAG3c26665dd [2019-11-20 00:22:16,068 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/data/7cf1a3a1c/953b61a81f9b4e2c87dde48a5a0061ea [2019-11-20 00:22:16,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:22:16,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:22:16,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:22:16,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:22:16,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:22:16,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:22:16" (1/1) ... [2019-11-20 00:22:16,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b6730e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16, skipping insertion in model container [2019-11-20 00:22:16,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:22:16" (1/1) ... [2019-11-20 00:22:16,088 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:22:16,104 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:22:16,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:22:16,245 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:22:16,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:22:16,336 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:22:16,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16 WrapperNode [2019-11-20 00:22:16,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:22:16,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:22:16,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:22:16,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:22:16,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16" (1/1) ... [2019-11-20 00:22:16,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16" (1/1) ... [2019-11-20 00:22:16,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:22:16,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:22:16,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:22:16,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:22:16,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16" (1/1) ... [2019-11-20 00:22:16,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16" (1/1) ... [2019-11-20 00:22:16,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16" (1/1) ... [2019-11-20 00:22:16,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16" (1/1) ... [2019-11-20 00:22:16,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16" (1/1) ... [2019-11-20 00:22:16,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16" (1/1) ... [2019-11-20 00:22:16,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16" (1/1) ... [2019-11-20 00:22:16,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:22:16,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:22:16,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:22:16,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:22:16,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:22:16,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:22:16,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:22:16,442 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-20 00:22:16,442 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-20 00:22:16,443 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-20 00:22:16,443 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-20 00:22:16,753 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:22:16,753 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 00:22:16,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:22:16 BoogieIcfgContainer [2019-11-20 00:22:16,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:22:16,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:22:16,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:22:16,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:22:16,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:22:16" (1/3) ... [2019-11-20 00:22:16,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e861d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:22:16, skipping insertion in model container [2019-11-20 00:22:16,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:16" (2/3) ... [2019-11-20 00:22:16,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e861d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:22:16, skipping insertion in model container [2019-11-20 00:22:16,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:22:16" (3/3) ... [2019-11-20 00:22:16,761 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2019-11-20 00:22:16,770 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:22:16,776 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:22:16,790 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:22:16,823 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:22:16,823 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:22:16,824 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:22:16,824 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:22:16,825 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:22:16,825 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:22:16,825 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:22:16,825 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:22:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-20 00:22:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 00:22:16,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:16,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:16,855 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:16,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-20 00:22:16,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:16,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612562218] [2019-11-20 00:22:16,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:17,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612562218] [2019-11-20 00:22:17,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:22:17,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 00:22:17,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672734404] [2019-11-20 00:22:17,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 00:22:17,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:17,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:22:17,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:22:17,104 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2019-11-20 00:22:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:17,232 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-20 00:22:17,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:22:17,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-20 00:22:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:17,247 INFO L225 Difference]: With dead ends: 38 [2019-11-20 00:22:17,247 INFO L226 Difference]: Without dead ends: 26 [2019-11-20 00:22:17,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:22:17,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-20 00:22:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-20 00:22:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 00:22:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-20 00:22:17,304 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-20 00:22:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:17,305 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-20 00:22:17,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 00:22:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-20 00:22:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 00:22:17,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:17,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:17,309 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:17,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:17,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-20 00:22:17,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:17,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656517901] [2019-11-20 00:22:17,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:17,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656517901] [2019-11-20 00:22:17,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:22:17,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 00:22:17,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499836699] [2019-11-20 00:22:17,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 00:22:17,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:17,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:22:17,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:22:17,381 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-11-20 00:22:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:17,467 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-20 00:22:17,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:22:17,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-20 00:22:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:17,469 INFO L225 Difference]: With dead ends: 32 [2019-11-20 00:22:17,469 INFO L226 Difference]: Without dead ends: 28 [2019-11-20 00:22:17,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:22:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-20 00:22:17,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-20 00:22:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 00:22:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-20 00:22:17,477 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-20 00:22:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:17,478 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-20 00:22:17,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 00:22:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-20 00:22:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 00:22:17,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:17,480 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:17,480 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:17,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:17,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-20 00:22:17,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:17,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179057728] [2019-11-20 00:22:17,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 00:22:17,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179057728] [2019-11-20 00:22:17,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453809696] [2019-11-20 00:22:17,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:17,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 00:22:17,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 00:22:17,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:17,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-20 00:22:17,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243249421] [2019-11-20 00:22:17,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 00:22:17,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:17,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 00:22:17,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 00:22:17,753 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2019-11-20 00:22:17,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:17,903 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-20 00:22:17,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 00:22:17,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-20 00:22:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:17,907 INFO L225 Difference]: With dead ends: 59 [2019-11-20 00:22:17,907 INFO L226 Difference]: Without dead ends: 35 [2019-11-20 00:22:17,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:22:17,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-20 00:22:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-20 00:22:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-20 00:22:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-20 00:22:17,915 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-20 00:22:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:17,916 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-20 00:22:17,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 00:22:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-20 00:22:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 00:22:17,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:17,918 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:18,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:18,124 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-20 00:22:18,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:18,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741411500] [2019-11-20 00:22:18,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 00:22:18,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741411500] [2019-11-20 00:22:18,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107936771] [2019-11-20 00:22:18,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:18,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 00:22:18,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 00:22:18,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:18,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-20 00:22:18,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644905364] [2019-11-20 00:22:18,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 00:22:18,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:18,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 00:22:18,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 00:22:18,356 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-11-20 00:22:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:18,576 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-20 00:22:18,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 00:22:18,577 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-20 00:22:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:18,580 INFO L225 Difference]: With dead ends: 55 [2019-11-20 00:22:18,581 INFO L226 Difference]: Without dead ends: 51 [2019-11-20 00:22:18,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:22:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-20 00:22:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-20 00:22:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-20 00:22:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-20 00:22:18,609 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-20 00:22:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:18,610 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-20 00:22:18,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 00:22:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-20 00:22:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 00:22:18,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:18,614 INFO L410 BasicCegarLoop]: trace histogram [3, 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, 1] [2019-11-20 00:22:18,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:18,817 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:18,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:18,818 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-20 00:22:18,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:18,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64994760] [2019-11-20 00:22:18,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:22:18,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64994760] [2019-11-20 00:22:18,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001648608] [2019-11-20 00:22:18,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:19,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 00:22:19,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:22:19,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:19,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-11-20 00:22:19,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834158508] [2019-11-20 00:22:19,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 00:22:19,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:19,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 00:22:19,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:22:19,103 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 14 states. [2019-11-20 00:22:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:19,565 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-20 00:22:19,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 00:22:19,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-11-20 00:22:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:19,569 INFO L225 Difference]: With dead ends: 114 [2019-11-20 00:22:19,569 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 00:22:19,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-20 00:22:19,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 00:22:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-20 00:22:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 00:22:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-20 00:22:19,600 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-20 00:22:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:19,606 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-20 00:22:19,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 00:22:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-20 00:22:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 00:22:19,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:19,610 INFO L410 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2019-11-20 00:22:19,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:19,813 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:19,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:19,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-20 00:22:19,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:19,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708489645] [2019-11-20 00:22:19,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:19,940 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:22:19,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708489645] [2019-11-20 00:22:19,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586030133] [2019-11-20 00:22:19,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:19,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 00:22:19,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:22:20,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:20,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-20 00:22:20,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40607665] [2019-11-20 00:22:20,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 00:22:20,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:20,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 00:22:20,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:22:20,119 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 14 states. [2019-11-20 00:22:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:20,403 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-20 00:22:20,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 00:22:20,403 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-20 00:22:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:20,405 INFO L225 Difference]: With dead ends: 147 [2019-11-20 00:22:20,406 INFO L226 Difference]: Without dead ends: 83 [2019-11-20 00:22:20,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-20 00:22:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-20 00:22:20,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-20 00:22:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 00:22:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-20 00:22:20,431 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-20 00:22:20,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:20,431 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-20 00:22:20,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 00:22:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-20 00:22:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 00:22:20,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:20,439 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:20,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:20,639 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:20,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:20,640 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-20 00:22:20,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:20,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197311804] [2019-11-20 00:22:20,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 00:22:20,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197311804] [2019-11-20 00:22:20,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516512666] [2019-11-20 00:22:20,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/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-11-20 00:22:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:20,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 00:22:20,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 00:22:21,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:21,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-11-20 00:22:21,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120740416] [2019-11-20 00:22:21,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 00:22:21,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:21,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 00:22:21,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-20 00:22:21,088 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 18 states. [2019-11-20 00:22:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:21,588 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-20 00:22:21,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 00:22:21,589 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-11-20 00:22:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:21,591 INFO L225 Difference]: With dead ends: 164 [2019-11-20 00:22:21,591 INFO L226 Difference]: Without dead ends: 100 [2019-11-20 00:22:21,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-11-20 00:22:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-20 00:22:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-20 00:22:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 00:22:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-20 00:22:21,609 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-20 00:22:21,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:21,609 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-20 00:22:21,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 00:22:21,609 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-20 00:22:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 00:22:21,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:21,613 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:21,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:21,818 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:21,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:21,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-11-20 00:22:21,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:21,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546687516] [2019-11-20 00:22:21,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-20 00:22:22,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546687516] [2019-11-20 00:22:22,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86839834] [2019-11-20 00:22:22,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:22,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 00:22:22,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 13 proven. 90 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 00:22:22,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:22,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2019-11-20 00:22:22,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052430609] [2019-11-20 00:22:22,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 00:22:22,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:22,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 00:22:22,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-11-20 00:22:22,373 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 20 states. [2019-11-20 00:22:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:22,963 INFO L93 Difference]: Finished difference Result 207 states and 388 transitions. [2019-11-20 00:22:22,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 00:22:22,963 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 91 [2019-11-20 00:22:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:22,966 INFO L225 Difference]: With dead ends: 207 [2019-11-20 00:22:22,966 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 00:22:22,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2019-11-20 00:22:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 00:22:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2019-11-20 00:22:22,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-20 00:22:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2019-11-20 00:22:22,983 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 91 [2019-11-20 00:22:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:22,984 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2019-11-20 00:22:22,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 00:22:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2019-11-20 00:22:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 00:22:22,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:22,987 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:23,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:23,190 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:23,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:23,190 INFO L82 PathProgramCache]: Analyzing trace with hash -463941571, now seen corresponding path program 1 times [2019-11-20 00:22:23,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:23,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203829936] [2019-11-20 00:22:23,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 53 proven. 117 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-20 00:22:23,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203829936] [2019-11-20 00:22:23,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737403294] [2019-11-20 00:22:23,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:23,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 00:22:23,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-20 00:22:23,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:23,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 23 [2019-11-20 00:22:23,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841389745] [2019-11-20 00:22:23,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 00:22:23,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:23,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 00:22:23,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-11-20 00:22:23,847 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand 23 states. [2019-11-20 00:22:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:24,666 INFO L93 Difference]: Finished difference Result 244 states and 473 transitions. [2019-11-20 00:22:24,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-20 00:22:24,667 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 119 [2019-11-20 00:22:24,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:24,669 INFO L225 Difference]: With dead ends: 244 [2019-11-20 00:22:24,669 INFO L226 Difference]: Without dead ends: 152 [2019-11-20 00:22:24,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 00:22:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-20 00:22:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2019-11-20 00:22:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-20 00:22:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 224 transitions. [2019-11-20 00:22:24,695 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 224 transitions. Word has length 119 [2019-11-20 00:22:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:24,698 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 224 transitions. [2019-11-20 00:22:24,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 00:22:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 224 transitions. [2019-11-20 00:22:24,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 00:22:24,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:24,704 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 13, 12, 12, 11, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:24,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:24,910 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:24,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:24,910 INFO L82 PathProgramCache]: Analyzing trace with hash 826902015, now seen corresponding path program 2 times [2019-11-20 00:22:24,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:24,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572878144] [2019-11-20 00:22:24,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 177 proven. 334 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2019-11-20 00:22:25,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572878144] [2019-11-20 00:22:25,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078452632] [2019-11-20 00:22:25,588 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:25,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:22:25,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:22:25,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 00:22:25,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 62 proven. 367 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-11-20 00:22:25,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:25,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12] total 31 [2019-11-20 00:22:25,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463083659] [2019-11-20 00:22:25,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-20 00:22:25,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-20 00:22:25,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2019-11-20 00:22:25,886 INFO L87 Difference]: Start difference. First operand 134 states and 224 transitions. Second operand 31 states. [2019-11-20 00:22:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:27,139 INFO L93 Difference]: Finished difference Result 343 states and 691 transitions. [2019-11-20 00:22:27,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-20 00:22:27,140 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 201 [2019-11-20 00:22:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:27,143 INFO L225 Difference]: With dead ends: 343 [2019-11-20 00:22:27,143 INFO L226 Difference]: Without dead ends: 205 [2019-11-20 00:22:27,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=424, Invalid=2882, Unknown=0, NotChecked=0, Total=3306 [2019-11-20 00:22:27,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-20 00:22:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 191. [2019-11-20 00:22:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-20 00:22:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 315 transitions. [2019-11-20 00:22:27,182 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 315 transitions. Word has length 201 [2019-11-20 00:22:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:27,183 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 315 transitions. [2019-11-20 00:22:27,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-20 00:22:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 315 transitions. [2019-11-20 00:22:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-11-20 00:22:27,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:27,196 INFO L410 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 31, 22, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 16, 12, 6, 4, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:27,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:27,399 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:27,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:27,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1943816299, now seen corresponding path program 3 times [2019-11-20 00:22:27,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:27,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137006261] [2019-11-20 00:22:27,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7468 backedges. 1750 proven. 2033 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2019-11-20 00:22:29,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137006261] [2019-11-20 00:22:29,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541581171] [2019-11-20 00:22:29,442 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:29,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-20 00:22:29,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:22:29,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 00:22:29,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7468 backedges. 1287 proven. 0 refuted. 0 times theorem prover too weak. 6181 trivial. 0 not checked. [2019-11-20 00:22:29,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:22:29,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [28] total 31 [2019-11-20 00:22:29,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234890549] [2019-11-20 00:22:29,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:22:29,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:29,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:22:29,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2019-11-20 00:22:29,723 INFO L87 Difference]: Start difference. First operand 191 states and 315 transitions. Second operand 6 states. [2019-11-20 00:22:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:29,790 INFO L93 Difference]: Finished difference Result 347 states and 604 transitions. [2019-11-20 00:22:29,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:22:29,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 506 [2019-11-20 00:22:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:29,793 INFO L225 Difference]: With dead ends: 347 [2019-11-20 00:22:29,793 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 00:22:29,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2019-11-20 00:22:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 00:22:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 161. [2019-11-20 00:22:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-20 00:22:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 247 transitions. [2019-11-20 00:22:29,808 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 247 transitions. Word has length 506 [2019-11-20 00:22:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:29,809 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 247 transitions. [2019-11-20 00:22:29,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:22:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 247 transitions. [2019-11-20 00:22:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-11-20 00:22:29,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:29,814 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 18, 16, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 3, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:30,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:30,018 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:30,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1893886498, now seen corresponding path program 4 times [2019-11-20 00:22:30,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:30,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250554686] [2019-11-20 00:22:30,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 191 proven. 567 refuted. 0 times theorem prover too weak. 1679 trivial. 0 not checked. [2019-11-20 00:22:30,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250554686] [2019-11-20 00:22:30,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096583217] [2019-11-20 00:22:30,804 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:30,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 00:22:30,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:22:30,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 00:22:30,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 114 proven. 657 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2019-11-20 00:22:31,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:31,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 27 [2019-11-20 00:22:31,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738837464] [2019-11-20 00:22:31,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 00:22:31,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:31,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 00:22:31,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2019-11-20 00:22:31,133 INFO L87 Difference]: Start difference. First operand 161 states and 247 transitions. Second operand 27 states. [2019-11-20 00:22:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:32,215 INFO L93 Difference]: Finished difference Result 367 states and 650 transitions. [2019-11-20 00:22:32,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-20 00:22:32,215 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 295 [2019-11-20 00:22:32,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:32,218 INFO L225 Difference]: With dead ends: 367 [2019-11-20 00:22:32,219 INFO L226 Difference]: Without dead ends: 211 [2019-11-20 00:22:32,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=389, Invalid=2263, Unknown=0, NotChecked=0, Total=2652 [2019-11-20 00:22:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-20 00:22:32,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 182. [2019-11-20 00:22:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-20 00:22:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 287 transitions. [2019-11-20 00:22:32,241 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 287 transitions. Word has length 295 [2019-11-20 00:22:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:32,241 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 287 transitions. [2019-11-20 00:22:32,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 00:22:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 287 transitions. [2019-11-20 00:22:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2019-11-20 00:22:32,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:32,254 INFO L410 BasicCegarLoop]: trace histogram [43, 43, 38, 38, 32, 32, 21, 21, 21, 21, 21, 21, 21, 19, 19, 19, 19, 19, 19, 19, 13, 11, 11, 6, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:32,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:32,459 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:32,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:32,460 INFO L82 PathProgramCache]: Analyzing trace with hash 665841761, now seen corresponding path program 5 times [2019-11-20 00:22:32,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:32,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382834150] [2019-11-20 00:22:32,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8940 backedges. 1003 proven. 2174 refuted. 0 times theorem prover too weak. 5763 trivial. 0 not checked. [2019-11-20 00:22:34,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382834150] [2019-11-20 00:22:34,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809333711] [2019-11-20 00:22:34,416 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:34,535 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-11-20 00:22:34,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:22:34,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 00:22:34,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8940 backedges. 2805 proven. 34 refuted. 0 times theorem prover too weak. 6101 trivial. 0 not checked. [2019-11-20 00:22:34,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:34,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12] total 30 [2019-11-20 00:22:34,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806733269] [2019-11-20 00:22:34,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-20 00:22:34,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:34,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-20 00:22:34,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2019-11-20 00:22:34,801 INFO L87 Difference]: Start difference. First operand 182 states and 287 transitions. Second operand 30 states. [2019-11-20 00:22:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:35,413 INFO L93 Difference]: Finished difference Result 376 states and 640 transitions. [2019-11-20 00:22:35,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 00:22:35,414 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 553 [2019-11-20 00:22:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:35,416 INFO L225 Difference]: With dead ends: 376 [2019-11-20 00:22:35,416 INFO L226 Difference]: Without dead ends: 204 [2019-11-20 00:22:35,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=1225, Unknown=0, NotChecked=0, Total=1406 [2019-11-20 00:22:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-20 00:22:35,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2019-11-20 00:22:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-20 00:22:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 312 transitions. [2019-11-20 00:22:35,435 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 312 transitions. Word has length 553 [2019-11-20 00:22:35,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:35,435 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 312 transitions. [2019-11-20 00:22:35,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-20 00:22:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 312 transitions. [2019-11-20 00:22:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2019-11-20 00:22:35,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:35,465 INFO L410 BasicCegarLoop]: trace histogram [66, 66, 61, 61, 52, 51, 33, 33, 33, 33, 33, 33, 33, 30, 30, 30, 30, 30, 30, 30, 22, 18, 14, 10, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:35,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:35,669 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:35,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1056772235, now seen corresponding path program 6 times [2019-11-20 00:22:35,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:35,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60749290] [2019-11-20 00:22:35,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 22353 backedges. 4314 proven. 5300 refuted. 0 times theorem prover too weak. 12739 trivial. 0 not checked. [2019-11-20 00:22:39,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60749290] [2019-11-20 00:22:39,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580212128] [2019-11-20 00:22:39,722 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:39,881 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-11-20 00:22:39,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:22:39,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 00:22:39,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 22353 backedges. 2273 proven. 86 refuted. 0 times theorem prover too weak. 19994 trivial. 0 not checked. [2019-11-20 00:22:40,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:40,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 13] total 46 [2019-11-20 00:22:40,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240281469] [2019-11-20 00:22:40,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-20 00:22:40,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:40,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-20 00:22:40,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1853, Unknown=0, NotChecked=0, Total=2070 [2019-11-20 00:22:40,354 INFO L87 Difference]: Start difference. First operand 199 states and 312 transitions. Second operand 46 states. [2019-11-20 00:22:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:41,512 INFO L93 Difference]: Finished difference Result 423 states and 736 transitions. [2019-11-20 00:22:41,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-20 00:22:41,512 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 868 [2019-11-20 00:22:41,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:41,516 INFO L225 Difference]: With dead ends: 423 [2019-11-20 00:22:41,516 INFO L226 Difference]: Without dead ends: 237 [2019-11-20 00:22:41,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1158 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=442, Invalid=3464, Unknown=0, NotChecked=0, Total=3906 [2019-11-20 00:22:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-20 00:22:41,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 203. [2019-11-20 00:22:41,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-20 00:22:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 291 transitions. [2019-11-20 00:22:41,534 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 291 transitions. Word has length 868 [2019-11-20 00:22:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:41,535 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 291 transitions. [2019-11-20 00:22:41,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-20 00:22:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 291 transitions. [2019-11-20 00:22:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2019-11-20 00:22:41,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:41,541 INFO L410 BasicCegarLoop]: trace histogram [48, 48, 45, 45, 38, 37, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 22, 22, 22, 22, 15, 14, 11, 7, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:41,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:41,744 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:41,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:41,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1510191266, now seen corresponding path program 7 times [2019-11-20 00:22:41,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:41,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078630260] [2019-11-20 00:22:41,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 2047 proven. 2656 refuted. 0 times theorem prover too weak. 7166 trivial. 0 not checked. [2019-11-20 00:22:44,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078630260] [2019-11-20 00:22:44,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244419819] [2019-11-20 00:22:44,334 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:44,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 00:22:44,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 325 proven. 1776 refuted. 0 times theorem prover too weak. 9768 trivial. 0 not checked. [2019-11-20 00:22:44,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:44,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 14] total 38 [2019-11-20 00:22:44,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634051251] [2019-11-20 00:22:44,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-20 00:22:44,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:44,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-20 00:22:44,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2019-11-20 00:22:44,852 INFO L87 Difference]: Start difference. First operand 203 states and 291 transitions. Second operand 38 states. [2019-11-20 00:22:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:22:46,270 INFO L93 Difference]: Finished difference Result 466 states and 775 transitions. [2019-11-20 00:22:46,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-11-20 00:22:46,270 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 636 [2019-11-20 00:22:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:22:46,274 INFO L225 Difference]: With dead ends: 466 [2019-11-20 00:22:46,275 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 00:22:46,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=479, Invalid=3303, Unknown=0, NotChecked=0, Total=3782 [2019-11-20 00:22:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 00:22:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 233. [2019-11-20 00:22:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-20 00:22:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 350 transitions. [2019-11-20 00:22:46,295 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 350 transitions. Word has length 636 [2019-11-20 00:22:46,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:22:46,296 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 350 transitions. [2019-11-20 00:22:46,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-20 00:22:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 350 transitions. [2019-11-20 00:22:46,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1685 [2019-11-20 00:22:46,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:22:46,316 INFO L410 BasicCegarLoop]: trace histogram [125, 125, 122, 122, 101, 98, 62, 62, 62, 62, 62, 62, 62, 61, 61, 61, 61, 61, 61, 61, 40, 36, 24, 24, 1, 1, 1, 1, 1, 1] [2019-11-20 00:22:46,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:46,520 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:22:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:46,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1612905355, now seen corresponding path program 8 times [2019-11-20 00:22:46,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:22:46,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881537463] [2019-11-20 00:22:46,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:22:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 85211 backedges. 15552 proven. 14733 refuted. 0 times theorem prover too weak. 54926 trivial. 0 not checked. [2019-11-20 00:22:56,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881537463] [2019-11-20 00:22:56,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612682589] [2019-11-20 00:22:56,145 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:22:56,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:22:56,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:22:56,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 3742 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 00:22:56,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:22:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 85211 backedges. 918 proven. 4385 refuted. 0 times theorem prover too weak. 79908 trivial. 0 not checked. [2019-11-20 00:22:58,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:22:58,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 13] total 53 [2019-11-20 00:22:58,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769041223] [2019-11-20 00:22:58,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-11-20 00:22:58,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:22:58,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-11-20 00:22:58,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2463, Unknown=0, NotChecked=0, Total=2756 [2019-11-20 00:22:58,036 INFO L87 Difference]: Start difference. First operand 233 states and 350 transitions. Second operand 53 states. [2019-11-20 00:23:00,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:23:00,661 INFO L93 Difference]: Finished difference Result 542 states and 878 transitions. [2019-11-20 00:23:00,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-11-20 00:23:00,661 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1684 [2019-11-20 00:23:00,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:23:00,665 INFO L225 Difference]: With dead ends: 542 [2019-11-20 00:23:00,666 INFO L226 Difference]: Without dead ends: 327 [2019-11-20 00:23:00,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2339 GetRequests, 2245 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2987 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=956, Invalid=8164, Unknown=0, NotChecked=0, Total=9120 [2019-11-20 00:23:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-20 00:23:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 279. [2019-11-20 00:23:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-20 00:23:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 434 transitions. [2019-11-20 00:23:00,695 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 434 transitions. Word has length 1684 [2019-11-20 00:23:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:23:00,699 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 434 transitions. [2019-11-20 00:23:00,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-11-20 00:23:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 434 transitions. [2019-11-20 00:23:00,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1182 [2019-11-20 00:23:00,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:23:00,712 INFO L410 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 70, 70, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 27, 27, 17, 16, 1, 1, 1, 1, 1, 1] [2019-11-20 00:23:00,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:23:00,926 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:23:00,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:23:00,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1116406177, now seen corresponding path program 9 times [2019-11-20 00:23:00,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:23:00,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259815352] [2019-11-20 00:23:00,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:23:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 41638 backedges. 4952 proven. 6432 refuted. 0 times theorem prover too weak. 30254 trivial. 0 not checked. [2019-11-20 00:23:06,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259815352] [2019-11-20 00:23:06,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102373414] [2019-11-20 00:23:06,190 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:23:06,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-11-20 00:23:06,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:23:06,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 00:23:06,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:23:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 41638 backedges. 15625 proven. 300 refuted. 0 times theorem prover too weak. 25713 trivial. 0 not checked. [2019-11-20 00:23:07,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:23:07,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 16] total 58 [2019-11-20 00:23:07,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147019143] [2019-11-20 00:23:07,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-11-20 00:23:07,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:23:07,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-11-20 00:23:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=2908, Unknown=0, NotChecked=0, Total=3306 [2019-11-20 00:23:07,516 INFO L87 Difference]: Start difference. First operand 279 states and 434 transitions. Second operand 58 states. [2019-11-20 00:23:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:23:09,746 INFO L93 Difference]: Finished difference Result 652 states and 1198 transitions. [2019-11-20 00:23:09,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-11-20 00:23:09,746 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1181 [2019-11-20 00:23:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:23:09,753 INFO L225 Difference]: With dead ends: 652 [2019-11-20 00:23:09,753 INFO L226 Difference]: Without dead ends: 394 [2019-11-20 00:23:09,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1607 GetRequests, 1529 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=723, Invalid=5597, Unknown=0, NotChecked=0, Total=6320 [2019-11-20 00:23:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-11-20 00:23:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 291. [2019-11-20 00:23:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-20 00:23:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 469 transitions. [2019-11-20 00:23:09,785 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 469 transitions. Word has length 1181 [2019-11-20 00:23:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:23:09,786 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 469 transitions. [2019-11-20 00:23:09,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-11-20 00:23:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 469 transitions. [2019-11-20 00:23:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1631 [2019-11-20 00:23:09,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:23:09,806 INFO L410 BasicCegarLoop]: trace histogram [121, 121, 118, 118, 97, 96, 60, 60, 60, 60, 60, 60, 60, 59, 59, 59, 59, 59, 59, 59, 37, 37, 25, 21, 1, 1, 1, 1, 1, 1] [2019-11-20 00:23:10,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:23:10,019 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:23:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:23:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2060059297, now seen corresponding path program 10 times [2019-11-20 00:23:10,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:23:10,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009793965] [2019-11-20 00:23:10,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:23:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 79792 backedges. 9794 proven. 12743 refuted. 0 times theorem prover too weak. 57255 trivial. 0 not checked. [2019-11-20 00:23:18,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009793965] [2019-11-20 00:23:18,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863203525] [2019-11-20 00:23:18,453 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:23:18,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 00:23:18,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:23:18,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 2902 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 00:23:18,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:23:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 79792 backedges. 1609 proven. 3518 refuted. 0 times theorem prover too weak. 74665 trivial. 0 not checked. [2019-11-20 00:23:20,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:23:20,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 13] total 46 [2019-11-20 00:23:20,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113213206] [2019-11-20 00:23:20,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-20 00:23:20,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:23:20,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-20 00:23:20,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1852, Unknown=0, NotChecked=0, Total=2070 [2019-11-20 00:23:20,037 INFO L87 Difference]: Start difference. First operand 291 states and 469 transitions. Second operand 46 states. [2019-11-20 00:23:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:23:21,657 INFO L93 Difference]: Finished difference Result 661 states and 1185 transitions. [2019-11-20 00:23:21,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-11-20 00:23:21,665 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1630 [2019-11-20 00:23:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:23:21,672 INFO L225 Difference]: With dead ends: 661 [2019-11-20 00:23:21,672 INFO L226 Difference]: Without dead ends: 387 [2019-11-20 00:23:21,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2228 GetRequests, 2149 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=715, Invalid=5765, Unknown=0, NotChecked=0, Total=6480 [2019-11-20 00:23:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-20 00:23:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 306. [2019-11-20 00:23:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-11-20 00:23:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2019-11-20 00:23:21,703 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 1630 [2019-11-20 00:23:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:23:21,704 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2019-11-20 00:23:21,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-20 00:23:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2019-11-20 00:23:21,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1386 [2019-11-20 00:23:21,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:23:21,720 INFO L410 BasicCegarLoop]: trace histogram [102, 102, 101, 101, 82, 82, 51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 50, 32, 31, 20, 19, 1, 1, 1, 1, 1, 1] [2019-11-20 00:23:21,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:23:21,925 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:23:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:23:21,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1871912262, now seen corresponding path program 11 times [2019-11-20 00:23:21,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:23:21,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883636454] [2019-11-20 00:23:21,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:23:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 2122 proven. 6522 refuted. 0 times theorem prover too weak. 48802 trivial. 0 not checked. [2019-11-20 00:23:27,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883636454] [2019-11-20 00:23:27,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582450095] [2019-11-20 00:23:27,510 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:23:28,073 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2019-11-20 00:23:28,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:23:28,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 2815 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 00:23:28,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:23:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 28196 proven. 2500 refuted. 0 times theorem prover too weak. 26750 trivial. 0 not checked. [2019-11-20 00:23:29,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:23:29,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 21] total 47 [2019-11-20 00:23:29,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239801931] [2019-11-20 00:23:29,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-20 00:23:29,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:23:29,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-20 00:23:29,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1914, Unknown=0, NotChecked=0, Total=2162 [2019-11-20 00:23:29,098 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 47 states. [2019-11-20 00:23:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:23:30,724 INFO L93 Difference]: Finished difference Result 642 states and 1085 transitions. [2019-11-20 00:23:30,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-11-20 00:23:30,724 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1385 [2019-11-20 00:23:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:23:30,729 INFO L225 Difference]: With dead ends: 642 [2019-11-20 00:23:30,729 INFO L226 Difference]: Without dead ends: 358 [2019-11-20 00:23:30,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1870 GetRequests, 1782 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2549 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=914, Invalid=7096, Unknown=0, NotChecked=0, Total=8010 [2019-11-20 00:23:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-20 00:23:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 304. [2019-11-20 00:23:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-20 00:23:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 466 transitions. [2019-11-20 00:23:30,754 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 466 transitions. Word has length 1385 [2019-11-20 00:23:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:23:30,755 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 466 transitions. [2019-11-20 00:23:30,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-20 00:23:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 466 transitions. [2019-11-20 00:23:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2019-11-20 00:23:30,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:23:30,769 INFO L410 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1] [2019-11-20 00:23:30,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:23:30,975 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:23:30,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:23:30,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1008927292, now seen corresponding path program 12 times [2019-11-20 00:23:30,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:23:30,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984289892] [2019-11-20 00:23:30,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:23:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:23:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:23:31,388 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:23:31,388 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 00:23:31,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:23:31 BoogieIcfgContainer [2019-11-20 00:23:31,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:23:31,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:23:31,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:23:31,547 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:23:31,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:22:16" (3/4) ... [2019-11-20 00:23:31,550 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 00:23:31,741 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ab7e780b-7656-491b-84ee-d197f24d06ce/bin/uautomizer/witness.graphml [2019-11-20 00:23:31,742 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:23:31,744 INFO L168 Benchmark]: Toolchain (without parser) took 75670.68 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 951.4 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-20 00:23:31,744 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:23:31,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:23:31,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:23:31,746 INFO L168 Benchmark]: Boogie Preprocessor took 12.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:23:31,747 INFO L168 Benchmark]: RCFGBuilder took 370.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:23:31,747 INFO L168 Benchmark]: TraceAbstraction took 74791.48 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-20 00:23:31,747 INFO L168 Benchmark]: Witness Printer took 194.78 ms. Allocated memory is still 5.0 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-11-20 00:23:31,749 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 370.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74791.48 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 194.78 ms. Allocated memory is still 5.0 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 10; [L37] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L18] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L20] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L18] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L20] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 55 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 74.7s, OverallIterations: 20, TraceHistogramMax: 125, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 669 SDtfs, 2202 SDslu, 8211 SDs, 0 SdLazy, 17859 SolverSat, 3145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13015 GetRequests, 12221 SyntacticMatches, 0 SemanticMatches, 794 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14458 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 497 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 42.8s InterpolantComputationTime, 19857 NumberOfCodeBlocks, 17634 NumberOfCodeBlocksAsserted, 190 NumberOfCheckSat, 18613 ConstructedInterpolants, 0 QuantifiedInterpolants, 28866182 SizeOfPredicates, 117 NumberOfNonLiveVariables, 15571 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 36 InterpolantComputations, 3 PerfectInterpolantSequences, 570186/637798 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...