./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/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 e21c3699338992ddad7e6d15f4351c8cc3315b0b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 07:19:27,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:19:27,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:19:27,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:19:27,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:19:27,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:19:27,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:19:27,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:19:27,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:19:27,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:19:27,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:19:27,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:19:27,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:19:27,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:19:27,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:19:27,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:19:27,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:19:27,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:19:27,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:19:27,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:19:27,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:19:27,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:19:27,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:19:27,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:19:27,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:19:27,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:19:27,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:19:27,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:19:27,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:19:27,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:19:27,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:19:27,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:19:27,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:19:27,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:19:27,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:19:27,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:19:27,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:19:27,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:19:27,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:19:27,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:19:27,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:19:27,617 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 07:19:27,641 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:19:27,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:19:27,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:19:27,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:19:27,653 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:19:27,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:19:27,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:19:27,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:19:27,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:19:27,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:19:27,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:19:27,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:19:27,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:19:27,655 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:19:27,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:19:27,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:19:27,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:19:27,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:19:27,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:19:27,657 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:19:27,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:19:27,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:19:27,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:19:27,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:19:27,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:19:27,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:19:27,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 07:19:27,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:19:27,659 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_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2019-11-20 07:19:27,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:19:27,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:19:27,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:19:27,853 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:19:27,853 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:19:27,854 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2019-11-20 07:19:27,909 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/data/d3720518e/5103bf51e1f7468aa8bc3f50661a7056/FLAGda1277bae [2019-11-20 07:19:28,277 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:19:28,277 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2019-11-20 07:19:28,281 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/data/d3720518e/5103bf51e1f7468aa8bc3f50661a7056/FLAGda1277bae [2019-11-20 07:19:28,292 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/data/d3720518e/5103bf51e1f7468aa8bc3f50661a7056 [2019-11-20 07:19:28,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:19:28,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:19:28,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:19:28,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:19:28,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:19:28,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:19:28" (1/1) ... [2019-11-20 07:19:28,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5568b1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28, skipping insertion in model container [2019-11-20 07:19:28,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:19:28" (1/1) ... [2019-11-20 07:19:28,310 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:19:28,325 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:19:28,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:19:28,519 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:19:28,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:19:28,646 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:19:28,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28 WrapperNode [2019-11-20 07:19:28,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:19:28,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:19:28,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:19:28,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:19:28,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28" (1/1) ... [2019-11-20 07:19:28,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28" (1/1) ... [2019-11-20 07:19:28,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:19:28,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:19:28,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:19:28,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:19:28,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28" (1/1) ... [2019-11-20 07:19:28,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28" (1/1) ... [2019-11-20 07:19:28,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28" (1/1) ... [2019-11-20 07:19:28,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28" (1/1) ... [2019-11-20 07:19:28,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28" (1/1) ... [2019-11-20 07:19:28,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28" (1/1) ... [2019-11-20 07:19:28,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28" (1/1) ... [2019-11-20 07:19:28,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:19:28,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:19:28,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:19:28,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:19:28,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:19:28,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:19:28,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:19:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-20 07:19:28,756 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-20 07:19:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-20 07:19:28,756 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-20 07:19:29,044 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:19:29,044 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 07:19:29,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:19:29 BoogieIcfgContainer [2019-11-20 07:19:29,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:19:29,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:19:29,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:19:29,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:19:29,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:19:28" (1/3) ... [2019-11-20 07:19:29,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae16413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:19:29, skipping insertion in model container [2019-11-20 07:19:29,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:19:28" (2/3) ... [2019-11-20 07:19:29,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae16413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:19:29, skipping insertion in model container [2019-11-20 07:19:29,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:19:29" (3/3) ... [2019-11-20 07:19:29,057 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2019-11-20 07:19:29,066 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:19:29,071 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 07:19:29,079 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 07:19:29,098 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:19:29,098 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:19:29,098 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:19:29,098 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:19:29,100 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:19:29,100 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:19:29,100 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:19:29,100 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:19:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-20 07:19:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 07:19:29,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:29,122 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:29,122 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:29,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:29,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-20 07:19:29,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:29,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902904251] [2019-11-20 07:19:29,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:19:29,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902904251] [2019-11-20 07:19:29,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:19:29,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 07:19:29,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397306175] [2019-11-20 07:19:29,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 07:19:29,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:29,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 07:19:29,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:19:29,350 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2019-11-20 07:19:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:29,488 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-20 07:19:29,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:19:29,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-20 07:19:29,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:29,498 INFO L225 Difference]: With dead ends: 38 [2019-11-20 07:19:29,498 INFO L226 Difference]: Without dead ends: 26 [2019-11-20 07:19:29,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:19:29,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-20 07:19:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-20 07:19:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 07:19:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-20 07:19:29,541 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-20 07:19:29,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:29,541 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-20 07:19:29,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 07:19:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-20 07:19:29,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 07:19:29,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:29,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:29,543 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:29,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:29,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-20 07:19:29,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:29,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472109131] [2019-11-20 07:19:29,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:19:29,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472109131] [2019-11-20 07:19:29,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:19:29,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 07:19:29,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744581392] [2019-11-20 07:19:29,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 07:19:29,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:29,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 07:19:29,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:19:29,648 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-11-20 07:19:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:29,822 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-20 07:19:29,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:19:29,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-20 07:19:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:29,826 INFO L225 Difference]: With dead ends: 32 [2019-11-20 07:19:29,826 INFO L226 Difference]: Without dead ends: 28 [2019-11-20 07:19:29,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:19:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-20 07:19:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-20 07:19:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 07:19:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-20 07:19:29,838 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-20 07:19:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:29,839 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-20 07:19:29,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 07:19:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-20 07:19:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 07:19:29,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:29,841 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:29,841 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:29,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:29,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-20 07:19:29,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:29,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020678021] [2019-11-20 07:19:29,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:19:30,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020678021] [2019-11-20 07:19:30,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572165860] [2019-11-20 07:19:30,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:30,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 07:19:30,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:19:30,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:19:30,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-20 07:19:30,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097705154] [2019-11-20 07:19:30,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 07:19:30,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 07:19:30,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 07:19:30,154 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2019-11-20 07:19:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:30,356 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-20 07:19:30,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 07:19:30,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-20 07:19:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:30,359 INFO L225 Difference]: With dead ends: 59 [2019-11-20 07:19:30,360 INFO L226 Difference]: Without dead ends: 35 [2019-11-20 07:19:30,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-20 07:19:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-20 07:19:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-20 07:19:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-20 07:19:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-20 07:19:30,372 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-20 07:19:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:30,373 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-20 07:19:30,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 07:19:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-20 07:19:30,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 07:19:30,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:30,376 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:30,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:30,589 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:30,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:30,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-20 07:19:30,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:30,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117465923] [2019-11-20 07:19:30,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:19:30,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117465923] [2019-11-20 07:19:30,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119831212] [2019-11-20 07:19:30,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:30,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 07:19:30,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 07:19:30,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:19:30,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-20 07:19:30,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553107597] [2019-11-20 07:19:30,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 07:19:30,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:30,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 07:19:30,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 07:19:30,840 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-11-20 07:19:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:31,087 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-20 07:19:31,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 07:19:31,088 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-20 07:19:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:31,093 INFO L225 Difference]: With dead ends: 55 [2019-11-20 07:19:31,093 INFO L226 Difference]: Without dead ends: 51 [2019-11-20 07:19:31,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-20 07:19:31,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-20 07:19:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-20 07:19:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-20 07:19:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-20 07:19:31,120 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-20 07:19:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:31,121 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-20 07:19:31,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 07:19:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-20 07:19:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 07:19:31,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:31,131 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:31,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:31,335 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-20 07:19:31,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:31,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897941899] [2019-11-20 07:19:31,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 07:19:31,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897941899] [2019-11-20 07:19:31,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484792773] [2019-11-20 07:19:31,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:31,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 07:19:31,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 07:19:31,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:19:31,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-11-20 07:19:31,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875960383] [2019-11-20 07:19:31,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 07:19:31,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:31,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 07:19:31,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-20 07:19:31,665 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 14 states. [2019-11-20 07:19:32,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:32,134 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-20 07:19:32,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 07:19:32,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-11-20 07:19:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:32,137 INFO L225 Difference]: With dead ends: 114 [2019-11-20 07:19:32,137 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 07:19:32,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-20 07:19:32,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 07:19:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-20 07:19:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 07:19:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-20 07:19:32,170 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-20 07:19:32,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:32,175 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-20 07:19:32,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 07:19:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-20 07:19:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 07:19:32,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:32,178 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:32,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:32,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-20 07:19:32,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:32,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495974615] [2019-11-20 07:19:32,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 07:19:32,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495974615] [2019-11-20 07:19:32,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019044663] [2019-11-20 07:19:32,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:32,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 07:19:32,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 07:19:32,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:19:32,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-20 07:19:32,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008897671] [2019-11-20 07:19:32,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 07:19:32,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 07:19:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-20 07:19:32,639 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 14 states. [2019-11-20 07:19:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:32,905 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-20 07:19:32,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 07:19:32,906 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-20 07:19:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:32,908 INFO L225 Difference]: With dead ends: 147 [2019-11-20 07:19:32,908 INFO L226 Difference]: Without dead ends: 83 [2019-11-20 07:19:32,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-20 07:19:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-20 07:19:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-20 07:19:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 07:19:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-20 07:19:32,942 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-20 07:19:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:32,942 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-20 07:19:32,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 07:19:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-20 07:19:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 07:19:32,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:32,945 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:33,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:33,149 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:33,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:33,149 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-20 07:19:33,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:33,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362869909] [2019-11-20 07:19:33,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 07:19:33,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362869909] [2019-11-20 07:19:33,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716482441] [2019-11-20 07:19:33,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:33,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 07:19:33,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 07:19:33,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:19:33,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-11-20 07:19:33,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553956659] [2019-11-20 07:19:33,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 07:19:33,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:33,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 07:19:33,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-20 07:19:33,485 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 18 states. [2019-11-20 07:19:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:33,947 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-20 07:19:33,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 07:19:33,947 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-11-20 07:19:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:33,949 INFO L225 Difference]: With dead ends: 164 [2019-11-20 07:19:33,950 INFO L226 Difference]: Without dead ends: 100 [2019-11-20 07:19:33,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-11-20 07:19:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-20 07:19:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-20 07:19:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 07:19:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-20 07:19:33,989 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-20 07:19:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:33,990 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-20 07:19:33,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 07:19:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-20 07:19:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 07:19:33,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:33,997 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:34,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:34,200 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:34,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-11-20 07:19:34,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:34,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754549375] [2019-11-20 07:19:34,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-20 07:19:34,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754549375] [2019-11-20 07:19:34,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615789768] [2019-11-20 07:19:34,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:34,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 07:19:34,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 13 proven. 90 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 07:19:34,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:19:34,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2019-11-20 07:19:34,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053910755] [2019-11-20 07:19:34,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 07:19:34,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:34,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 07:19:34,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-11-20 07:19:34,732 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 20 states. [2019-11-20 07:19:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:35,328 INFO L93 Difference]: Finished difference Result 207 states and 388 transitions. [2019-11-20 07:19:35,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 07:19:35,328 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 91 [2019-11-20 07:19:35,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:35,331 INFO L225 Difference]: With dead ends: 207 [2019-11-20 07:19:35,331 INFO L226 Difference]: Without dead ends: 114 [2019-11-20 07:19:35,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2019-11-20 07:19:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-20 07:19:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2019-11-20 07:19:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-20 07:19:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2019-11-20 07:19:35,360 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 91 [2019-11-20 07:19:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:35,361 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2019-11-20 07:19:35,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 07:19:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2019-11-20 07:19:35,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 07:19:35,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:35,363 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:35,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:35,568 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash -463941571, now seen corresponding path program 1 times [2019-11-20 07:19:35,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:35,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541822672] [2019-11-20 07:19:35,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,908 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 53 proven. 117 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-20 07:19:35,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541822672] [2019-11-20 07:19:35,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856354296] [2019-11-20 07:19:35,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:35,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 07:19:35,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-20 07:19:36,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:19:36,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 23 [2019-11-20 07:19:36,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912642427] [2019-11-20 07:19:36,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 07:19:36,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:36,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 07:19:36,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-11-20 07:19:36,226 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand 23 states. [2019-11-20 07:19:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:37,074 INFO L93 Difference]: Finished difference Result 244 states and 473 transitions. [2019-11-20 07:19:37,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-20 07:19:37,074 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 119 [2019-11-20 07:19:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:37,077 INFO L225 Difference]: With dead ends: 244 [2019-11-20 07:19:37,077 INFO L226 Difference]: Without dead ends: 152 [2019-11-20 07:19:37,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 07:19:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-20 07:19:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2019-11-20 07:19:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-20 07:19:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 224 transitions. [2019-11-20 07:19:37,096 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 224 transitions. Word has length 119 [2019-11-20 07:19:37,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:37,096 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 224 transitions. [2019-11-20 07:19:37,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 07:19:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 224 transitions. [2019-11-20 07:19:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 07:19:37,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:37,100 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 13, 12, 12, 11, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:37,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:37,304 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:37,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:37,304 INFO L82 PathProgramCache]: Analyzing trace with hash 826902015, now seen corresponding path program 2 times [2019-11-20 07:19:37,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:37,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549919533] [2019-11-20 07:19:37,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 177 proven. 334 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2019-11-20 07:19:38,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549919533] [2019-11-20 07:19:38,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749802271] [2019-11-20 07:19:38,028 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:38,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 07:19:38,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:19:38,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 07:19:38,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 62 proven. 367 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-11-20 07:19:38,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:19:38,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12] total 31 [2019-11-20 07:19:38,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983646351] [2019-11-20 07:19:38,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-20 07:19:38,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:38,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-20 07:19:38,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2019-11-20 07:19:38,317 INFO L87 Difference]: Start difference. First operand 134 states and 224 transitions. Second operand 31 states. [2019-11-20 07:19:39,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:39,596 INFO L93 Difference]: Finished difference Result 343 states and 691 transitions. [2019-11-20 07:19:39,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-20 07:19:39,597 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 201 [2019-11-20 07:19:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:39,600 INFO L225 Difference]: With dead ends: 343 [2019-11-20 07:19:39,600 INFO L226 Difference]: Without dead ends: 205 [2019-11-20 07:19:39,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=424, Invalid=2882, Unknown=0, NotChecked=0, Total=3306 [2019-11-20 07:19:39,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-20 07:19:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 191. [2019-11-20 07:19:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-20 07:19:39,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 315 transitions. [2019-11-20 07:19:39,634 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 315 transitions. Word has length 201 [2019-11-20 07:19:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:39,635 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 315 transitions. [2019-11-20 07:19:39,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-20 07:19:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 315 transitions. [2019-11-20 07:19:39,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-11-20 07:19:39,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:39,645 INFO L410 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 31, 22, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 16, 12, 6, 4, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:39,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:39,856 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:39,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1943816299, now seen corresponding path program 3 times [2019-11-20 07:19:39,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:39,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578765951] [2019-11-20 07:19:39,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7468 backedges. 1750 proven. 2033 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2019-11-20 07:19:41,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578765951] [2019-11-20 07:19:41,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093806680] [2019-11-20 07:19:41,857 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:41,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-20 07:19:41,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:19:41,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 07:19:41,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7468 backedges. 1287 proven. 0 refuted. 0 times theorem prover too weak. 6181 trivial. 0 not checked. [2019-11-20 07:19:42,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 07:19:42,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [28] total 31 [2019-11-20 07:19:42,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626540656] [2019-11-20 07:19:42,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:19:42,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:42,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:19:42,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2019-11-20 07:19:42,147 INFO L87 Difference]: Start difference. First operand 191 states and 315 transitions. Second operand 6 states. [2019-11-20 07:19:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:42,207 INFO L93 Difference]: Finished difference Result 347 states and 604 transitions. [2019-11-20 07:19:42,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:19:42,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 506 [2019-11-20 07:19:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:42,211 INFO L225 Difference]: With dead ends: 347 [2019-11-20 07:19:42,211 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 07:19:42,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2019-11-20 07:19:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 07:19:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 161. [2019-11-20 07:19:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-20 07:19:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 247 transitions. [2019-11-20 07:19:42,227 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 247 transitions. Word has length 506 [2019-11-20 07:19:42,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:42,228 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 247 transitions. [2019-11-20 07:19:42,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:19:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 247 transitions. [2019-11-20 07:19:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-11-20 07:19:42,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:42,233 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 18, 16, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 3, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:42,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:42,436 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:42,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1893886498, now seen corresponding path program 4 times [2019-11-20 07:19:42,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:42,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577549274] [2019-11-20 07:19:42,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 191 proven. 567 refuted. 0 times theorem prover too weak. 1679 trivial. 0 not checked. [2019-11-20 07:19:43,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577549274] [2019-11-20 07:19:43,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128093362] [2019-11-20 07:19:43,258 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:43,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 07:19:43,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:19:43,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 07:19:43,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 168 proven. 433 refuted. 0 times theorem prover too weak. 1836 trivial. 0 not checked. [2019-11-20 07:19:43,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:19:43,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 25 [2019-11-20 07:19:43,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334283198] [2019-11-20 07:19:43,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 07:19:43,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:43,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 07:19:43,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2019-11-20 07:19:43,545 INFO L87 Difference]: Start difference. First operand 161 states and 247 transitions. Second operand 25 states. [2019-11-20 07:19:44,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:44,372 INFO L93 Difference]: Finished difference Result 360 states and 589 transitions. [2019-11-20 07:19:44,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-20 07:19:44,373 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 295 [2019-11-20 07:19:44,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:44,376 INFO L225 Difference]: With dead ends: 360 [2019-11-20 07:19:44,376 INFO L226 Difference]: Without dead ends: 206 [2019-11-20 07:19:44,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1466, Unknown=0, NotChecked=0, Total=1722 [2019-11-20 07:19:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-20 07:19:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 166. [2019-11-20 07:19:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-20 07:19:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 250 transitions. [2019-11-20 07:19:44,399 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 250 transitions. Word has length 295 [2019-11-20 07:19:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:44,400 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 250 transitions. [2019-11-20 07:19:44,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 07:19:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 250 transitions. [2019-11-20 07:19:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-11-20 07:19:44,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:44,409 INFO L410 BasicCegarLoop]: trace histogram [29, 29, 26, 26, 22, 22, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 9, 8, 7, 4, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:44,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:44,613 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2008181936, now seen corresponding path program 5 times [2019-11-20 07:19:44,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:44,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904100774] [2019-11-20 07:19:44,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4062 backedges. 826 proven. 1069 refuted. 0 times theorem prover too weak. 2167 trivial. 0 not checked. [2019-11-20 07:19:46,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904100774] [2019-11-20 07:19:46,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484046882] [2019-11-20 07:19:46,265 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:46,364 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-20 07:19:46,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:19:46,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 07:19:46,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4062 backedges. 2172 proven. 63 refuted. 0 times theorem prover too weak. 1827 trivial. 0 not checked. [2019-11-20 07:19:46,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:19:46,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 12] total 45 [2019-11-20 07:19:46,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703764042] [2019-11-20 07:19:46,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-20 07:19:46,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:46,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-20 07:19:46,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1751, Unknown=0, NotChecked=0, Total=1980 [2019-11-20 07:19:46,597 INFO L87 Difference]: Start difference. First operand 166 states and 250 transitions. Second operand 45 states. [2019-11-20 07:19:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:47,669 INFO L93 Difference]: Finished difference Result 355 states and 609 transitions. [2019-11-20 07:19:47,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-20 07:19:47,669 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 377 [2019-11-20 07:19:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:47,673 INFO L225 Difference]: With dead ends: 355 [2019-11-20 07:19:47,673 INFO L226 Difference]: Without dead ends: 198 [2019-11-20 07:19:47,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=398, Invalid=3024, Unknown=0, NotChecked=0, Total=3422 [2019-11-20 07:19:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-20 07:19:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2019-11-20 07:19:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-20 07:19:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 265 transitions. [2019-11-20 07:19:47,695 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 265 transitions. Word has length 377 [2019-11-20 07:19:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:47,696 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 265 transitions. [2019-11-20 07:19:47,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-20 07:19:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 265 transitions. [2019-11-20 07:19:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-11-20 07:19:47,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:47,702 INFO L410 BasicCegarLoop]: trace histogram [43, 43, 36, 36, 33, 31, 21, 21, 21, 21, 21, 21, 21, 18, 18, 18, 18, 18, 18, 18, 15, 10, 10, 5, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:47,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:47,914 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:47,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:47,914 INFO L82 PathProgramCache]: Analyzing trace with hash 668070468, now seen corresponding path program 6 times [2019-11-20 07:19:47,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:47,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295490533] [2019-11-20 07:19:47,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 1756 proven. 2163 refuted. 0 times theorem prover too weak. 4658 trivial. 0 not checked. [2019-11-20 07:19:50,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295490533] [2019-11-20 07:19:50,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856281010] [2019-11-20 07:19:50,122 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:50,230 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-20 07:19:50,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:19:50,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 07:19:50,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8577 backedges. 883 proven. 123 refuted. 0 times theorem prover too weak. 7571 trivial. 0 not checked. [2019-11-20 07:19:50,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:19:50,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 37 [2019-11-20 07:19:50,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113704062] [2019-11-20 07:19:50,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-20 07:19:50,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:50,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-20 07:19:50,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1190, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 07:19:50,579 INFO L87 Difference]: Start difference. First operand 185 states and 265 transitions. Second operand 37 states. [2019-11-20 07:19:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:51,719 INFO L93 Difference]: Finished difference Result 447 states and 707 transitions. [2019-11-20 07:19:51,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-20 07:19:51,721 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 541 [2019-11-20 07:19:51,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:51,725 INFO L225 Difference]: With dead ends: 447 [2019-11-20 07:19:51,725 INFO L226 Difference]: Without dead ends: 266 [2019-11-20 07:19:51,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=394, Invalid=2798, Unknown=0, NotChecked=0, Total=3192 [2019-11-20 07:19:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-20 07:19:51,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 197. [2019-11-20 07:19:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-20 07:19:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 286 transitions. [2019-11-20 07:19:51,744 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 286 transitions. Word has length 541 [2019-11-20 07:19:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:51,744 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 286 transitions. [2019-11-20 07:19:51,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-20 07:19:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 286 transitions. [2019-11-20 07:19:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2019-11-20 07:19:51,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:51,751 INFO L410 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 46, 45, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 18, 17, 12, 10, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:51,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:51,955 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:51,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:51,955 INFO L82 PathProgramCache]: Analyzing trace with hash 67886044, now seen corresponding path program 7 times [2019-11-20 07:19:51,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:51,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953237320] [2019-11-20 07:19:51,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 17593 backedges. 2214 proven. 3722 refuted. 0 times theorem prover too weak. 11657 trivial. 0 not checked. [2019-11-20 07:19:55,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953237320] [2019-11-20 07:19:55,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758143135] [2019-11-20 07:19:55,429 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:55,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 1717 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 07:19:55,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:19:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 17593 backedges. 666 proven. 1475 refuted. 0 times theorem prover too weak. 15452 trivial. 0 not checked. [2019-11-20 07:19:56,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:19:56,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 13] total 57 [2019-11-20 07:19:56,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002823296] [2019-11-20 07:19:56,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-11-20 07:19:56,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:19:56,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-11-20 07:19:56,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2861, Unknown=0, NotChecked=0, Total=3192 [2019-11-20 07:19:56,094 INFO L87 Difference]: Start difference. First operand 197 states and 286 transitions. Second operand 57 states. [2019-11-20 07:19:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:19:58,363 INFO L93 Difference]: Finished difference Result 483 states and 854 transitions. [2019-11-20 07:19:58,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-11-20 07:19:58,364 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 772 [2019-11-20 07:19:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:19:58,367 INFO L225 Difference]: With dead ends: 483 [2019-11-20 07:19:58,367 INFO L226 Difference]: Without dead ends: 193 [2019-11-20 07:19:58,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1085 GetRequests, 993 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3140 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=870, Invalid=7686, Unknown=0, NotChecked=0, Total=8556 [2019-11-20 07:19:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-20 07:19:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 157. [2019-11-20 07:19:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-20 07:19:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2019-11-20 07:19:58,383 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 772 [2019-11-20 07:19:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:19:58,384 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2019-11-20 07:19:58,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-11-20 07:19:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2019-11-20 07:19:58,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-11-20 07:19:58,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:19:58,388 INFO L410 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 31, 31, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 12, 8, 7, 1, 1, 1, 1, 1, 1] [2019-11-20 07:19:58,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:19:58,593 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:19:58,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:19:58,594 INFO L82 PathProgramCache]: Analyzing trace with hash 49896623, now seen corresponding path program 8 times [2019-11-20 07:19:58,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:19:58,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581019985] [2019-11-20 07:19:58,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:19:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:19:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:20:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 1477 proven. 1482 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2019-11-20 07:20:00,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581019985] [2019-11-20 07:20:00,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997404575] [2019-11-20 07:20:00,386 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:20:00,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 07:20:00,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 07:20:00,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 07:20:00,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:20:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 946 proven. 464 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-11-20 07:20:00,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 07:20:00,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 13] total 39 [2019-11-20 07:20:00,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663567663] [2019-11-20 07:20:00,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-20 07:20:00,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:20:00,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-20 07:20:00,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 07:20:00,893 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand 39 states. [2019-11-20 07:20:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:20:01,872 INFO L93 Difference]: Finished difference Result 238 states and 287 transitions. [2019-11-20 07:20:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-20 07:20:01,873 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 527 [2019-11-20 07:20:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:20:01,875 INFO L225 Difference]: With dead ends: 238 [2019-11-20 07:20:01,876 INFO L226 Difference]: Without dead ends: 176 [2019-11-20 07:20:01,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 681 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=3104, Unknown=0, NotChecked=0, Total=3540 [2019-11-20 07:20:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-20 07:20:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2019-11-20 07:20:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-20 07:20:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2019-11-20 07:20:01,887 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 527 [2019-11-20 07:20:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:20:01,888 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 192 transitions. [2019-11-20 07:20:01,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-20 07:20:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2019-11-20 07:20:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-11-20 07:20:01,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:20:01,892 INFO L410 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1] [2019-11-20 07:20:02,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 07:20:02,096 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:20:02,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:20:02,096 INFO L82 PathProgramCache]: Analyzing trace with hash 706303904, now seen corresponding path program 9 times [2019-11-20 07:20:02,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:20:02,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818689711] [2019-11-20 07:20:02,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:20:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:20:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:20:02,247 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:20:02,247 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 07:20:02,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:20:02 BoogieIcfgContainer [2019-11-20 07:20:02,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:20:02,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:20:02,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:20:02,374 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:20:02,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:19:29" (3/4) ... [2019-11-20 07:20:02,376 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 07:20:02,484 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2cff6b25-abb9-49ed-aee2-8aa103f42fc5/bin/uautomizer/witness.graphml [2019-11-20 07:20:02,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:20:02,486 INFO L168 Benchmark]: Toolchain (without parser) took 34190.48 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 951.4 MB in the beginning and 1.7 GB in the end (delta: -752.9 MB). Peak memory consumption was 296.7 MB. Max. memory is 11.5 GB. [2019-11-20 07:20:02,486 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:20:02,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -212.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 07:20:02,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:20:02,487 INFO L168 Benchmark]: Boogie Preprocessor took 21.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-20 07:20:02,488 INFO L168 Benchmark]: RCFGBuilder took 341.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-20 07:20:02,488 INFO L168 Benchmark]: TraceAbstraction took 33326.81 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 883.4 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -592.3 MB). Peak memory consumption was 291.1 MB. Max. memory is 11.5 GB. [2019-11-20 07:20:02,489 INFO L168 Benchmark]: Witness Printer took 110.65 ms. Allocated memory is still 2.1 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-11-20 07:20:02,490 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.23 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 351.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -212.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 341.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33326.81 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 883.4 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -592.3 MB). Peak memory consumption was 291.1 MB. Max. memory is 11.5 GB. * Witness Printer took 110.65 ms. Allocated memory is still 2.1 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 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 = 8; [L37] CALL, EXPR fibo1(x) 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); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 21 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 33.2s, OverallIterations: 17, TraceHistogramMax: 57, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 511 SDtfs, 1530 SDslu, 5313 SDs, 0 SdLazy, 10750 SolverSat, 1835 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5223 GetRequests, 4672 SyntacticMatches, 2 SemanticMatches, 549 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7980 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=14, 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, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 7668 NumberOfCodeBlocks, 6664 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 7179 ConstructedInterpolants, 0 QuantifiedInterpolants, 5175968 SizeOfPredicates, 77 NumberOfNonLiveVariables, 5763 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 30 InterpolantComputations, 3 PerfectInterpolantSequences, 85122/99912 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...