./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-cad4683 [2019-11-15 21:39:42,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:39:42,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:39:42,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:39:42,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:39:42,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:39:42,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:39:43,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:39:43,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:39:43,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:39:43,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:39:43,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:39:43,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:39:43,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:39:43,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:39:43,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:39:43,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:39:43,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:39:43,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:39:43,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:39:43,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:39:43,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:39:43,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:39:43,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:39:43,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:39:43,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:39:43,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:39:43,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:39:43,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:39:43,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:39:43,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:39:43,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:39:43,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:39:43,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:39:43,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:39:43,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:39:43,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:39:43,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:39:43,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:39:43,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:39:43,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:39:43,054 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:39:43,082 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:39:43,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:39:43,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:39:43,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:39:43,084 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:39:43,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:39:43,084 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:39:43,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:39:43,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:39:43,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:39:43,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:39:43,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:39:43,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:39:43,086 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:39:43,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:39:43,086 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:39:43,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:39:43,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:39:43,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:39:43,087 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:39:43,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:39:43,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:39:43,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:39:43,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:39:43,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:39:43,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:39:43,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:39:43,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:39:43,089 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_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:39:43,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:39:43,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:39:43,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:39:43,148 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:39:43,149 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:39:43,151 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2019-11-15 21:39:43,214 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/bin/uautomizer/data/0526997bb/0c27786a392941eb97804c19d256bf5e/FLAG0cdaeed1e [2019-11-15 21:39:43,567 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:39:43,568 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2019-11-15 21:39:43,575 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/bin/uautomizer/data/0526997bb/0c27786a392941eb97804c19d256bf5e/FLAG0cdaeed1e [2019-11-15 21:39:43,945 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/bin/uautomizer/data/0526997bb/0c27786a392941eb97804c19d256bf5e [2019-11-15 21:39:43,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:39:43,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:39:43,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:39:43,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:39:43,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:39:43,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:39:43" (1/1) ... [2019-11-15 21:39:43,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55cb20ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:43, skipping insertion in model container [2019-11-15 21:39:43,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:39:43" (1/1) ... [2019-11-15 21:39:43,968 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:39:43,985 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:39:44,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:39:44,153 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:39:44,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:39:44,260 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:39:44,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:44 WrapperNode [2019-11-15 21:39:44,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:39:44,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:39:44,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:39:44,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:39:44,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:44" (1/1) ... [2019-11-15 21:39:44,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:44" (1/1) ... [2019-11-15 21:39:44,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:39:44,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:39:44,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:39:44,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:39:44,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:44" (1/1) ... [2019-11-15 21:39:44,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:44" (1/1) ... [2019-11-15 21:39:44,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:44" (1/1) ... [2019-11-15 21:39:44,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:44" (1/1) ... [2019-11-15 21:39:44,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:44" (1/1) ... [2019-11-15 21:39:44,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:44" (1/1) ... [2019-11-15 21:39:44,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:44" (1/1) ... [2019-11-15 21:39:44,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:39:44,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:39:44,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:39:44,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:39:44,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:39:44,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:39:44,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:39:44,388 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-15 21:39:44,388 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-15 21:39:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-15 21:39:44,389 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-15 21:39:44,729 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:39:44,732 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 21:39:44,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:39:44 BoogieIcfgContainer [2019-11-15 21:39:44,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:39:44,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:39:44,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:39:44,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:39:44,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:39:43" (1/3) ... [2019-11-15 21:39:44,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd48e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:39:44, skipping insertion in model container [2019-11-15 21:39:44,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:39:44" (2/3) ... [2019-11-15 21:39:44,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd48e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:39:44, skipping insertion in model container [2019-11-15 21:39:44,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:39:44" (3/3) ... [2019-11-15 21:39:44,746 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2019-11-15 21:39:44,755 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:39:44,761 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:39:44,772 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:39:44,801 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:39:44,801 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:39:44,801 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:39:44,801 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:39:44,801 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:39:44,801 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:39:44,801 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:39:44,802 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:39:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-15 21:39:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 21:39:44,824 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:44,825 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:44,826 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:39:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:44,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-15 21:39:44,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:44,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774007685] [2019-11-15 21:39:44,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:44,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:44,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,067 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-15 21:39:45,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774007685] [2019-11-15 21:39:45,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:39:45,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:39:45,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721426115] [2019-11-15 21:39:45,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:39:45,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:45,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:39:45,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:39:45,087 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2019-11-15 21:39:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:45,218 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-15 21:39:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:39:45,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-15 21:39:45,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:45,229 INFO L225 Difference]: With dead ends: 38 [2019-11-15 21:39:45,229 INFO L226 Difference]: Without dead ends: 26 [2019-11-15 21:39:45,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:39:45,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-15 21:39:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-15 21:39:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 21:39:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-15 21:39:45,282 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-15 21:39:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:45,282 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 21:39:45,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:39:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-15 21:39:45,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:39:45,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:45,284 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:45,285 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:39:45,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:45,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-15 21:39:45,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:45,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797252783] [2019-11-15 21:39:45,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:45,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:45,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,434 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-15 21:39:45,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797252783] [2019-11-15 21:39:45,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:39:45,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:39:45,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025166380] [2019-11-15 21:39:45,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:39:45,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:45,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:39:45,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:39:45,437 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-11-15 21:39:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:45,593 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-15 21:39:45,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:39:45,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-15 21:39:45,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:45,596 INFO L225 Difference]: With dead ends: 32 [2019-11-15 21:39:45,596 INFO L226 Difference]: Without dead ends: 28 [2019-11-15 21:39:45,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:39:45,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-15 21:39:45,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-15 21:39:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 21:39:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-15 21:39:45,604 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-15 21:39:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:45,605 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 21:39:45,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:39:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-15 21:39:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 21:39:45,606 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:45,606 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:45,607 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:39:45,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:45,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-15 21:39:45,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:45,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860722451] [2019-11-15 21:39:45,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:45,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:45,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,839 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-15 21:39:45,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860722451] [2019-11-15 21:39:45,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682359754] [2019-11-15 21:39:45,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:39:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:45,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:39:45,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:45,978 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-15 21:39:45,978 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:45,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-15 21:39:45,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090560500] [2019-11-15 21:39:45,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:39:45,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:45,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:39:45,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:39:45,981 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2019-11-15 21:39:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:46,180 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-15 21:39:46,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:39:46,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-15 21:39:46,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:46,183 INFO L225 Difference]: With dead ends: 59 [2019-11-15 21:39:46,183 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 21:39:46,184 INFO L600 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-15 21:39:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 21:39:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-15 21:39:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 21:39:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-15 21:39:46,193 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-15 21:39:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:46,194 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-15 21:39:46,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:39:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-15 21:39:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:39:46,196 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:46,196 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:46,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:46,408 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:39:46,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:46,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-15 21:39:46,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:46,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378829921] [2019-11-15 21:39:46,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:46,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:46,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:46,554 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-15 21:39:46,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378829921] [2019-11-15 21:39:46,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617767704] [2019-11-15 21:39:46,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:39:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:46,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:39:46,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:46,650 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-15 21:39:46,650 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:46,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-15 21:39:46,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681984376] [2019-11-15 21:39:46,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:39:46,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:46,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:39:46,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:39:46,652 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-11-15 21:39:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:46,913 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-15 21:39:46,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:39:46,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-15 21:39:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:46,918 INFO L225 Difference]: With dead ends: 55 [2019-11-15 21:39:46,918 INFO L226 Difference]: Without dead ends: 51 [2019-11-15 21:39:46,919 INFO L600 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-15 21:39:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-15 21:39:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-15 21:39:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-15 21:39:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-15 21:39:46,944 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-15 21:39:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:46,945 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-15 21:39:46,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:39:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-15 21:39:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:39:46,947 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:46,948 INFO L380 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-15 21:39:47,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:47,154 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:39:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:47,154 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-15 21:39:47,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:47,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544113105] [2019-11-15 21:39:47,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:47,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:47,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:47,375 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-15 21:39:47,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544113105] [2019-11-15 21:39:47,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62100288] [2019-11-15 21:39:47,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:39:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:47,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:39:47,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:47,504 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-15 21:39:47,505 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:47,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-11-15 21:39:47,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174518730] [2019-11-15 21:39:47,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 21:39:47,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:47,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:39:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:39:47,507 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 14 states. [2019-11-15 21:39:48,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:48,000 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-15 21:39:48,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:39:48,001 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-11-15 21:39:48,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:48,003 INFO L225 Difference]: With dead ends: 114 [2019-11-15 21:39:48,003 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 21:39:48,007 INFO L600 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-15 21:39:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 21:39:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-15 21:39:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 21:39:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-15 21:39:48,022 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-15 21:39:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:48,022 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-15 21:39:48,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 21:39:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-15 21:39:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:39:48,025 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:48,026 INFO L380 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-15 21:39:48,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:48,239 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:39:48,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:48,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-15 21:39:48,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:48,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361989091] [2019-11-15 21:39:48,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:48,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:48,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:48,382 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-15 21:39:48,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361989091] [2019-11-15 21:39:48,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696708232] [2019-11-15 21:39:48,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:39:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:48,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:39:48,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:48,540 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-15 21:39:48,541 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:48,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-15 21:39:48,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673424047] [2019-11-15 21:39:48,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 21:39:48,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:48,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:39:48,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:39:48,543 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 14 states. [2019-11-15 21:39:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:48,870 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-15 21:39:48,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:39:48,871 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-15 21:39:48,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:48,873 INFO L225 Difference]: With dead ends: 147 [2019-11-15 21:39:48,873 INFO L226 Difference]: Without dead ends: 83 [2019-11-15 21:39:48,875 INFO L600 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-15 21:39:48,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-15 21:39:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-15 21:39:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 21:39:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-15 21:39:48,889 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-15 21:39:48,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:48,890 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-15 21:39:48,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 21:39:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-15 21:39:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 21:39:48,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:48,893 INFO L380 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-15 21:39:49,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:49,102 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:39:49,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:49,102 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-15 21:39:49,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:49,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77087080] [2019-11-15 21:39:49,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:49,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:49,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:49,450 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-15 21:39:49,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77087080] [2019-11-15 21:39:49,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371741842] [2019-11-15 21:39:49,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:39:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:49,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:39:49,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:49,592 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-15 21:39:49,593 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:49,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-11-15 21:39:49,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484309627] [2019-11-15 21:39:49,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 21:39:49,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:39:49,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:39:49,595 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 18 states. [2019-11-15 21:39:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:50,090 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-15 21:39:50,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:39:50,090 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-11-15 21:39:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:50,093 INFO L225 Difference]: With dead ends: 164 [2019-11-15 21:39:50,093 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 21:39:50,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-11-15 21:39:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 21:39:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-15 21:39:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 21:39:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-15 21:39:50,112 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-15 21:39:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:50,113 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-15 21:39:50,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 21:39:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-15 21:39:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 21:39:50,119 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:50,119 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:50,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:50,324 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:39:50,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:50,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1894743046, now seen corresponding path program 2 times [2019-11-15 21:39:50,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:50,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241795822] [2019-11-15 21:39:50,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:50,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:50,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 33 proven. 56 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-15 21:39:50,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241795822] [2019-11-15 21:39:50,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738095966] [2019-11-15 21:39:50,688 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:39:50,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:39:50,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:39:50,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:39:50,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 13 proven. 88 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-15 21:39:50,870 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:50,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-11-15 21:39:50,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631924461] [2019-11-15 21:39:50,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 21:39:50,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:50,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 21:39:50,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-11-15 21:39:50,872 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 21 states. [2019-11-15 21:39:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:51,612 INFO L93 Difference]: Finished difference Result 212 states and 399 transitions. [2019-11-15 21:39:51,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 21:39:51,613 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 90 [2019-11-15 21:39:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:51,615 INFO L225 Difference]: With dead ends: 212 [2019-11-15 21:39:51,615 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 21:39:51,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 21:39:51,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 21:39:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2019-11-15 21:39:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-15 21:39:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2019-11-15 21:39:51,629 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 90 [2019-11-15 21:39:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:51,630 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2019-11-15 21:39:51,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 21:39:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2019-11-15 21:39:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-15 21:39:51,636 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:51,636 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:51,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:51,840 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:39:51,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1964260674, now seen corresponding path program 1 times [2019-11-15 21:39:51,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:51,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326685769] [2019-11-15 21:39:51,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:51,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:51,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 105 proven. 218 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-11-15 21:39:52,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326685769] [2019-11-15 21:39:52,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181966719] [2019-11-15 21:39:52,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:39:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:52,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 21:39:52,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 34 proven. 245 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2019-11-15 21:39:52,743 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:52,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 27 [2019-11-15 21:39:52,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321274932] [2019-11-15 21:39:52,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 21:39:52,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:52,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 21:39:52,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2019-11-15 21:39:52,745 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand 27 states. [2019-11-15 21:39:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:53,683 INFO L93 Difference]: Finished difference Result 225 states and 389 transitions. [2019-11-15 21:39:53,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-15 21:39:53,684 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 161 [2019-11-15 21:39:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:53,686 INFO L225 Difference]: With dead ends: 225 [2019-11-15 21:39:53,686 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 21:39:53,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=1865, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 21:39:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 21:39:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2019-11-15 21:39:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 21:39:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 190 transitions. [2019-11-15 21:39:53,708 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 190 transitions. Word has length 161 [2019-11-15 21:39:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:53,708 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 190 transitions. [2019-11-15 21:39:53,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 21:39:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 190 transitions. [2019-11-15 21:39:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-15 21:39:53,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:53,715 INFO L380 BasicCegarLoop]: trace histogram [29, 29, 21, 18, 18, 18, 14, 14, 14, 14, 14, 14, 14, 12, 9, 9, 9, 9, 9, 9, 9, 8, 4, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:53,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:53,919 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:39:53,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1170842485, now seen corresponding path program 1 times [2019-11-15 21:39:53,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:53,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352381781] [2019-11-15 21:39:53,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:53,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:53,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3107 backedges. 727 proven. 853 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2019-11-15 21:39:55,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352381781] [2019-11-15 21:39:55,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412268526] [2019-11-15 21:39:55,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:39:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:55,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:39:55,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3107 backedges. 90 proven. 698 refuted. 0 times theorem prover too weak. 2319 trivial. 0 not checked. [2019-11-15 21:39:55,626 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:55,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12] total 33 [2019-11-15 21:39:55,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555625368] [2019-11-15 21:39:55,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 21:39:55,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:55,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 21:39:55,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 21:39:55,629 INFO L87 Difference]: Start difference. First operand 126 states and 190 transitions. Second operand 33 states. [2019-11-15 21:39:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:39:57,048 INFO L93 Difference]: Finished difference Result 368 states and 710 transitions. [2019-11-15 21:39:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-15 21:39:57,049 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 324 [2019-11-15 21:39:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:39:57,053 INFO L225 Difference]: With dead ends: 368 [2019-11-15 21:39:57,053 INFO L226 Difference]: Without dead ends: 198 [2019-11-15 21:39:57,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=326, Invalid=2326, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 21:39:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-15 21:39:57,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 172. [2019-11-15 21:39:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-15 21:39:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 277 transitions. [2019-11-15 21:39:57,104 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 277 transitions. Word has length 324 [2019-11-15 21:39:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:39:57,105 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 277 transitions. [2019-11-15 21:39:57,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 21:39:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 277 transitions. [2019-11-15 21:39:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-11-15 21:39:57,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:39:57,118 INFO L380 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 25, 23, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 9, 9, 8, 6, 1, 1, 1, 1, 1, 1] [2019-11-15 21:39:57,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:39:57,323 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:39:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:39:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1564556796, now seen corresponding path program 2 times [2019-11-15 21:39:57,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:39:57,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708473388] [2019-11-15 21:39:57,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:57,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:39:57,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:39:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:39:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5297 backedges. 865 proven. 1147 refuted. 0 times theorem prover too weak. 3285 trivial. 0 not checked. [2019-11-15 21:39:58,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708473388] [2019-11-15 21:39:58,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815921506] [2019-11-15 21:39:58,894 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:39:59,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:39:59,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:39:59,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 21:39:59,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:39:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5297 backedges. 153 proven. 1054 refuted. 0 times theorem prover too weak. 4090 trivial. 0 not checked. [2019-11-15 21:39:59,404 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:39:59,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 30 [2019-11-15 21:39:59,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272152954] [2019-11-15 21:39:59,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 21:39:59,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:39:59,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 21:39:59,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2019-11-15 21:39:59,407 INFO L87 Difference]: Start difference. First operand 172 states and 277 transitions. Second operand 30 states. [2019-11-15 21:40:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:40:00,820 INFO L93 Difference]: Finished difference Result 429 states and 814 transitions. [2019-11-15 21:40:00,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-15 21:40:00,821 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 429 [2019-11-15 21:40:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:40:00,827 INFO L225 Difference]: With dead ends: 429 [2019-11-15 21:40:00,827 INFO L226 Difference]: Without dead ends: 245 [2019-11-15 21:40:00,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=381, Invalid=2375, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 21:40:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-15 21:40:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 213. [2019-11-15 21:40:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-15 21:40:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 344 transitions. [2019-11-15 21:40:00,872 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 344 transitions. Word has length 429 [2019-11-15 21:40:00,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:40:00,874 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 344 transitions. [2019-11-15 21:40:00,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 21:40:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 344 transitions. [2019-11-15 21:40:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2019-11-15 21:40:00,906 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:40:00,907 INFO L380 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 48, 47, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 19, 18, 11, 11, 1, 1, 1, 1, 1, 1] [2019-11-15 21:40:01,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:40:01,112 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:40:01,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:40:01,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1985313236, now seen corresponding path program 3 times [2019-11-15 21:40:01,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:40:01,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765069882] [2019-11-15 21:40:01,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:40:01,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:40:01,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:40:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 18913 backedges. 4059 proven. 3474 refuted. 0 times theorem prover too weak. 11380 trivial. 0 not checked. [2019-11-15 21:40:06,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765069882] [2019-11-15 21:40:06,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460899700] [2019-11-15 21:40:06,264 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:40:06,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-11-15 21:40:06,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:40:06,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:40:06,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:40:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18913 backedges. 6822 proven. 63 refuted. 0 times theorem prover too weak. 12028 trivial. 0 not checked. [2019-11-15 21:40:07,222 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:40:07,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 12] total 59 [2019-11-15 21:40:07,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404452441] [2019-11-15 21:40:07,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-11-15 21:40:07,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:40:07,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-11-15 21:40:07,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=3080, Unknown=0, NotChecked=0, Total=3422 [2019-11-15 21:40:07,232 INFO L87 Difference]: Start difference. First operand 213 states and 344 transitions. Second operand 59 states. [2019-11-15 21:40:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:40:09,847 INFO L93 Difference]: Finished difference Result 505 states and 1009 transitions. [2019-11-15 21:40:09,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-15 21:40:09,847 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 800 [2019-11-15 21:40:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:40:09,854 INFO L225 Difference]: With dead ends: 505 [2019-11-15 21:40:09,854 INFO L226 Difference]: Without dead ends: 301 [2019-11-15 21:40:09,861 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1138 GetRequests, 1041 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3358 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=972, Invalid=8730, Unknown=0, NotChecked=0, Total=9702 [2019-11-15 21:40:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-15 21:40:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 231. [2019-11-15 21:40:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-15 21:40:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 345 transitions. [2019-11-15 21:40:09,893 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 345 transitions. Word has length 800 [2019-11-15 21:40:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:40:09,894 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 345 transitions. [2019-11-15 21:40:09,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-11-15 21:40:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 345 transitions. [2019-11-15 21:40:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2019-11-15 21:40:09,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:40:09,903 INFO L380 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 42, 41, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 17, 15, 10, 10, 1, 1, 1, 1, 1, 1] [2019-11-15 21:40:10,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:40:10,109 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:40:10,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:40:10,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1828768247, now seen corresponding path program 4 times [2019-11-15 21:40:10,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:40:10,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420602156] [2019-11-15 21:40:10,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:40:10,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:40:10,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:40:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 14585 backedges. 568 proven. 2342 refuted. 0 times theorem prover too weak. 11675 trivial. 0 not checked. [2019-11-15 21:40:12,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420602156] [2019-11-15 21:40:12,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829699528] [2019-11-15 21:40:12,923 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:40:13,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:40:13,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:40:13,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 21:40:13,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:40:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14585 backedges. 298 proven. 2056 refuted. 0 times theorem prover too weak. 12231 trivial. 0 not checked. [2019-11-15 21:40:13,750 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:40:13,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 14] total 35 [2019-11-15 21:40:13,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702037449] [2019-11-15 21:40:13,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 21:40:13,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:40:13,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 21:40:13,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 21:40:13,758 INFO L87 Difference]: Start difference. First operand 231 states and 345 transitions. Second operand 35 states. [2019-11-15 21:40:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:40:15,617 INFO L93 Difference]: Finished difference Result 541 states and 924 transitions. [2019-11-15 21:40:15,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-15 21:40:15,618 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 704 [2019-11-15 21:40:15,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:40:15,624 INFO L225 Difference]: With dead ends: 541 [2019-11-15 21:40:15,624 INFO L226 Difference]: Without dead ends: 309 [2019-11-15 21:40:15,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 965 GetRequests, 903 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=510, Invalid=3522, Unknown=0, NotChecked=0, Total=4032 [2019-11-15 21:40:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-15 21:40:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 268. [2019-11-15 21:40:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-15 21:40:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 409 transitions. [2019-11-15 21:40:15,655 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 409 transitions. Word has length 704 [2019-11-15 21:40:15,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:40:15,656 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 409 transitions. [2019-11-15 21:40:15,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 21:40:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 409 transitions. [2019-11-15 21:40:15,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3198 [2019-11-15 21:40:15,732 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:40:15,734 INFO L380 BasicCegarLoop]: trace histogram [237, 237, 232, 232, 191, 189, 118, 118, 118, 118, 118, 118, 118, 116, 116, 116, 116, 116, 116, 116, 75, 71, 46, 43, 1, 1, 1, 1, 1, 1] [2019-11-15 21:40:15,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:40:15,939 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:40:15,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:40:15,939 INFO L82 PathProgramCache]: Analyzing trace with hash -258429711, now seen corresponding path program 5 times [2019-11-15 21:40:15,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:40:15,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513123454] [2019-11-15 21:40:15,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:40:15,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:40:15,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:40:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:40:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 309251 backedges. 34195 proven. 58670 refuted. 0 times theorem prover too weak. 216386 trivial. 0 not checked. [2019-11-15 21:40:55,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513123454] [2019-11-15 21:40:55,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179529253] [2019-11-15 21:40:55,492 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:40:55,924 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-11-15 21:40:55,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:40:55,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 21:40:55,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:41:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 309251 backedges. 117699 proven. 926 refuted. 0 times theorem prover too weak. 190626 trivial. 0 not checked. [2019-11-15 21:41:00,733 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:41:00,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 19] total 70 [2019-11-15 21:41:00,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287462831] [2019-11-15 21:41:00,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-11-15 21:41:00,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:41:00,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-11-15 21:41:00,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=4321, Unknown=0, NotChecked=0, Total=4830 [2019-11-15 21:41:00,743 INFO L87 Difference]: Start difference. First operand 268 states and 409 transitions. Second operand 70 states. [2019-11-15 21:41:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:41:03,269 INFO L93 Difference]: Finished difference Result 629 states and 1086 transitions. [2019-11-15 21:41:03,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-11-15 21:41:03,269 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 3197 [2019-11-15 21:41:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:41:03,276 INFO L225 Difference]: With dead ends: 629 [2019-11-15 21:41:03,277 INFO L226 Difference]: Without dead ends: 371 [2019-11-15 21:41:03,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4342 GetRequests, 4242 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3992 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1004, Invalid=9096, Unknown=0, NotChecked=0, Total=10100 [2019-11-15 21:41:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-15 21:41:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 267. [2019-11-15 21:41:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-15 21:41:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 382 transitions. [2019-11-15 21:41:03,311 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 382 transitions. Word has length 3197 [2019-11-15 21:41:03,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:41:03,313 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 382 transitions. [2019-11-15 21:41:03,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-11-15 21:41:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 382 transitions. [2019-11-15 21:41:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2026 [2019-11-15 21:41:03,355 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:41:03,357 INFO L380 BasicCegarLoop]: trace histogram [150, 150, 147, 147, 121, 119, 75, 75, 75, 75, 75, 75, 75, 73, 73, 73, 73, 73, 73, 73, 48, 44, 29, 28, 1, 1, 1, 1, 1, 1] [2019-11-15 21:41:03,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:41:03,597 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:41:03,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:41:03,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1041794199, now seen corresponding path program 6 times [2019-11-15 21:41:03,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:41:03,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127955366] [2019-11-15 21:41:03,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:41:03,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:41:03,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:41:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 123517 backedges. 14396 proven. 16738 refuted. 0 times theorem prover too weak. 92383 trivial. 0 not checked. [2019-11-15 21:41:17,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127955366] [2019-11-15 21:41:17,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908195436] [2019-11-15 21:41:17,483 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:41:17,963 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2019-11-15 21:41:17,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:41:17,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 1597 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 21:41:18,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:41:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 123517 backedges. 2223 proven. 5289 refuted. 0 times theorem prover too weak. 116005 trivial. 0 not checked. [2019-11-15 21:41:20,104 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:41:20,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 47 [2019-11-15 21:41:20,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715766158] [2019-11-15 21:41:20,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-15 21:41:20,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:41:20,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-15 21:41:20,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1932, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 21:41:20,110 INFO L87 Difference]: Start difference. First operand 267 states and 382 transitions. Second operand 47 states. [2019-11-15 21:41:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:41:22,781 INFO L93 Difference]: Finished difference Result 617 states and 1124 transitions. [2019-11-15 21:41:22,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-11-15 21:41:22,782 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2025 [2019-11-15 21:41:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:41:22,789 INFO L225 Difference]: With dead ends: 617 [2019-11-15 21:41:22,789 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 21:41:22,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2742 GetRequests, 2666 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1922 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=669, Invalid=5183, Unknown=0, NotChecked=0, Total=5852 [2019-11-15 21:41:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 21:41:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 244. [2019-11-15 21:41:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-11-15 21:41:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 343 transitions. [2019-11-15 21:41:22,821 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 343 transitions. Word has length 2025 [2019-11-15 21:41:22,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:41:22,824 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 343 transitions. [2019-11-15 21:41:22,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-15 21:41:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 343 transitions. [2019-11-15 21:41:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1781 [2019-11-15 21:41:22,852 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:41:22,853 INFO L380 BasicCegarLoop]: trace histogram [131, 131, 130, 130, 106, 105, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 41, 40, 25, 25, 1, 1, 1, 1, 1, 1] [2019-11-15 21:41:23,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:41:23,060 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:41:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:41:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1059415942, now seen corresponding path program 7 times [2019-11-15 21:41:23,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:41:23,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702969796] [2019-11-15 21:41:23,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:41:23,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:41:23,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:41:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 95265 backedges. 7865 proven. 9295 refuted. 0 times theorem prover too weak. 78105 trivial. 0 not checked. [2019-11-15 21:41:33,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702969796] [2019-11-15 21:41:33,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924874120] [2019-11-15 21:41:33,402 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:41:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:34,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 3955 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 21:41:34,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:41:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 95265 backedges. 3541 proven. 3034 refuted. 0 times theorem prover too weak. 88690 trivial. 0 not checked. [2019-11-15 21:41:36,276 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:41:36,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 15] total 69 [2019-11-15 21:41:36,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613875822] [2019-11-15 21:41:36,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-15 21:41:36,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:41:36,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-15 21:41:36,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=4204, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 21:41:36,283 INFO L87 Difference]: Start difference. First operand 244 states and 343 transitions. Second operand 69 states. [2019-11-15 21:41:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:41:39,530 INFO L93 Difference]: Finished difference Result 539 states and 842 transitions. [2019-11-15 21:41:39,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-11-15 21:41:39,530 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1780 [2019-11-15 21:41:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:41:39,535 INFO L225 Difference]: With dead ends: 539 [2019-11-15 21:41:39,535 INFO L226 Difference]: Without dead ends: 244 [2019-11-15 21:41:39,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2420 GetRequests, 2289 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6652 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1645, Invalid=15911, Unknown=0, NotChecked=0, Total=17556 [2019-11-15 21:41:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-15 21:41:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 218. [2019-11-15 21:41:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-15 21:41:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2019-11-15 21:41:39,559 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 1780 [2019-11-15 21:41:39,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:41:39,561 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2019-11-15 21:41:39,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-15 21:41:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2019-11-15 21:41:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2019-11-15 21:41:39,572 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:41:39,573 INFO L380 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 61, 61, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 24, 23, 15, 14, 1, 1, 1, 1, 1, 1] [2019-11-15 21:41:39,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:41:39,780 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:41:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:41:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2120753046, now seen corresponding path program 8 times [2019-11-15 21:41:39,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:41:39,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375485858] [2019-11-15 21:41:39,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:41:39,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:41:39,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:41:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:41:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2642 proven. 3388 refuted. 0 times theorem prover too weak. 25606 trivial. 0 not checked. [2019-11-15 21:41:43,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375485858] [2019-11-15 21:41:43,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292723910] [2019-11-15 21:41:43,770 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/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-15 21:41:44,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:41:44,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:41:44,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 2292 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 21:41:44,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:41:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2426 proven. 749 refuted. 0 times theorem prover too weak. 28461 trivial. 0 not checked. [2019-11-15 21:41:44,732 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:41:44,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 41 [2019-11-15 21:41:44,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164239594] [2019-11-15 21:41:44,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-15 21:41:44,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:41:44,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-15 21:41:44,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 21:41:44,734 INFO L87 Difference]: Start difference. First operand 218 states and 254 transitions. Second operand 41 states. [2019-11-15 21:41:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:41:46,014 INFO L93 Difference]: Finished difference Result 269 states and 313 transitions. [2019-11-15 21:41:46,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-15 21:41:46,014 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1031 [2019-11-15 21:41:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:41:46,018 INFO L225 Difference]: With dead ends: 269 [2019-11-15 21:41:46,018 INFO L226 Difference]: Without dead ends: 249 [2019-11-15 21:41:46,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1392 GetRequests, 1329 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=489, Invalid=3671, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 21:41:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-15 21:41:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 226. [2019-11-15 21:41:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-15 21:41:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 255 transitions. [2019-11-15 21:41:46,045 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 255 transitions. Word has length 1031 [2019-11-15 21:41:46,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:41:46,046 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 255 transitions. [2019-11-15 21:41:46,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-15 21:41:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 255 transitions. [2019-11-15 21:41:46,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2019-11-15 21:41:46,061 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:41:46,062 INFO L380 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-15 21:41:46,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:41:46,269 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:41:46,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:41:46,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1008927292, now seen corresponding path program 9 times [2019-11-15 21:41:46,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:41:46,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409947630] [2019-11-15 21:41:46,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:41:46,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:41:46,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:41:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:41:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:41:46,880 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:41:46,881 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:41:47,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:41:47 BoogieIcfgContainer [2019-11-15 21:41:47,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:41:47,115 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:41:47,115 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:41:47,115 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:41:47,116 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:39:44" (3/4) ... [2019-11-15 21:41:47,119 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:41:47,350 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3b5ff2c3-4a1a-45ff-9ef3-d5e7a4eafae6/bin/uautomizer/witness.graphml [2019-11-15 21:41:47,351 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:41:47,354 INFO L168 Benchmark]: Toolchain (without parser) took 123403.26 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 944.7 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-15 21:41:47,354 INFO L168 Benchmark]: CDTParser took 0.36 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-15 21:41:47,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:41:47,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.31 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-15 21:41:47,356 INFO L168 Benchmark]: Boogie Preprocessor took 16.30 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-15 21:41:47,356 INFO L168 Benchmark]: RCFGBuilder took 422.69 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:41:47,357 INFO L168 Benchmark]: TraceAbstraction took 122379.25 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-15 21:41:47,357 INFO L168 Benchmark]: Witness Printer took 236.14 ms. Allocated memory is still 5.1 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:41:47,360 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.36 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 310.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.31 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 16.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 422.69 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 122379.25 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 236.14 ms. Allocated memory is still 5.1 GB. Free memory was 3.3 GB in the beginning and 3.3 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: 122.3s, OverallIterations: 18, TraceHistogramMax: 237, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 687 SDtfs, 2557 SDslu, 8452 SDs, 0 SdLazy, 18545 SolverSat, 3588 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14795 GetRequests, 13993 SyntacticMatches, 2 SemanticMatches, 800 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20202 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=13, 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, 17 MinimizatonAttempts, 446 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 78.5s InterpolantComputationTime, 22641 NumberOfCodeBlocks, 18078 NumberOfCodeBlocksAsserted, 132 NumberOfCheckSat, 21401 ConstructedInterpolants, 0 QuantifiedInterpolants, 51843871 SizeOfPredicates, 107 NumberOfNonLiveVariables, 13597 ConjunctsInSsa, 216 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 1094574/1205032 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...