./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/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.23-1dbac8b [2018-11-10 10:53:51,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:53:51,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:53:51,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:53:51,495 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:53:51,495 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:53:51,496 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:53:51,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:53:51,498 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:53:51,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:53:51,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:53:51,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:53:51,500 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:53:51,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:53:51,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:53:51,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:53:51,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:53:51,504 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:53:51,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:53:51,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:53:51,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:53:51,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:53:51,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:53:51,509 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:53:51,509 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:53:51,510 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:53:51,511 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:53:51,511 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:53:51,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:53:51,512 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:53:51,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:53:51,513 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:53:51,513 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:53:51,513 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:53:51,514 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:53:51,514 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:53:51,514 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 10:53:51,521 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:53:51,521 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:53:51,522 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:53:51,522 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:53:51,522 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:53:51,522 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:53:51,523 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:53:51,523 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:53:51,523 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:53:51,523 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:53:51,523 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:53:51,523 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:53:51,523 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:53:51,524 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:53:51,524 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:53:51,524 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:53:51,524 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:53:51,524 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:53:51,524 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:53:51,524 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:53:51,525 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:53:51,525 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:53:51,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:53:51,525 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:53:51,525 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:53:51,525 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:53:51,525 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:53:51,526 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:53:51,526 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:53:51,526 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/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 [2018-11-10 10:53:51,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:53:51,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:53:51,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:53:51,559 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:53:51,559 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:53:51,559 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-10 10:53:51,599 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/data/db6361b69/e77fbf0143f64167acbf3cb5e97c059d/FLAGde7637196 [2018-11-10 10:53:51,891 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:53:51,891 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-10 10:53:51,895 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/data/db6361b69/e77fbf0143f64167acbf3cb5e97c059d/FLAGde7637196 [2018-11-10 10:53:51,905 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/data/db6361b69/e77fbf0143f64167acbf3cb5e97c059d [2018-11-10 10:53:51,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:53:51,908 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:53:51,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:53:51,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:53:51,910 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:53:51,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:53:51" (1/1) ... [2018-11-10 10:53:51,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:51, skipping insertion in model container [2018-11-10 10:53:51,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:53:51" (1/1) ... [2018-11-10 10:53:51,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:53:51,931 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:53:52,027 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:53:52,029 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:53:52,038 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:53:52,047 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:53:52,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:52 WrapperNode [2018-11-10 10:53:52,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:53:52,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:53:52,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:53:52,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:53:52,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:52" (1/1) ... [2018-11-10 10:53:52,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:52" (1/1) ... [2018-11-10 10:53:52,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:52" (1/1) ... [2018-11-10 10:53:52,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:52" (1/1) ... [2018-11-10 10:53:52,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:52" (1/1) ... [2018-11-10 10:53:52,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:52" (1/1) ... [2018-11-10 10:53:52,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:52" (1/1) ... [2018-11-10 10:53:52,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:53:52,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:53:52,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:53:52,071 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:53:52,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/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 [2018-11-10 10:53:52,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:53:52,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:53:52,148 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-10 10:53:52,149 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-10 10:53:52,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:53:52,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 10:53:52,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:53:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-10 10:53:52,151 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-10 10:53:52,151 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:53:52,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:53:52,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:53:52,281 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:53:52,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:53:52 BoogieIcfgContainer [2018-11-10 10:53:52,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:53:52,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:53:52,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:53:52,285 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:53:52,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:53:51" (1/3) ... [2018-11-10 10:53:52,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21db1192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:53:52, skipping insertion in model container [2018-11-10 10:53:52,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:53:52" (2/3) ... [2018-11-10 10:53:52,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21db1192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:53:52, skipping insertion in model container [2018-11-10 10:53:52,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:53:52" (3/3) ... [2018-11-10 10:53:52,288 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-10 10:53:52,295 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:53:52,301 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:53:52,314 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:53:52,338 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:53:52,339 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:53:52,339 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:53:52,339 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:53:52,339 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:53:52,339 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:53:52,339 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:53:52,339 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:53:52,340 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:53:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-10 10:53:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 10:53:52,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:52,360 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:52,362 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:52,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-10 10:53:52,367 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:52,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:52,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:52,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:52,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:53:52,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:53:52,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:53:52,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:53:52,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:53:52,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:53:52,496 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-10 10:53:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:52,562 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-10 10:53:52,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:53:52,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 10:53:52,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:52,570 INFO L225 Difference]: With dead ends: 44 [2018-11-10 10:53:52,570 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 10:53:52,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:53:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 10:53:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 10:53:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 10:53:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-10 10:53:52,600 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-10 10:53:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:52,600 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-10 10:53:52,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:53:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-10 10:53:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 10:53:52,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:52,601 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:52,601 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:52,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-10 10:53:52,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:52,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:52,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:52,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:52,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:53:52,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:53:52,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:53:52,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:53:52,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:53:52,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:53:52,646 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-10 10:53:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:52,727 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-10 10:53:52,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:53:52,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-10 10:53:52,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:52,729 INFO L225 Difference]: With dead ends: 36 [2018-11-10 10:53:52,729 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 10:53:52,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:53:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 10:53:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-10 10:53:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 10:53:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-10 10:53:52,735 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-10 10:53:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:52,735 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-10 10:53:52,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:53:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-10 10:53:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 10:53:52,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:52,736 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:52,736 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:52,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:52,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-10 10:53:52,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:52,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:52,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:52,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:52,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:53:52,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:52,820 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:52,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:52,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:53:52,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:52,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-10 10:53:52,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:53:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:53:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:53:52,916 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-11-10 10:53:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:53,054 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-11-10 10:53:53,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:53:53,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-10 10:53:53,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:53,056 INFO L225 Difference]: With dead ends: 58 [2018-11-10 10:53:53,056 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 10:53:53,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:53:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 10:53:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-10 10:53:53,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 10:53:53,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-10 10:53:53,063 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-11-10 10:53:53,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:53,063 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-10 10:53:53,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:53:53,064 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-10 10:53:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:53:53,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:53,065 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:53,065 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:53,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:53,065 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-11-10 10:53:53,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:53,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:53,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:53,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:53,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:53:53,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:53,125 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:53,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:53,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:53:53,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:53,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 10:53:53,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:53:53,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:53:53,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:53:53,174 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-11-10 10:53:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:53,236 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-10 10:53:53,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:53:53,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-10 10:53:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:53,237 INFO L225 Difference]: With dead ends: 43 [2018-11-10 10:53:53,238 INFO L226 Difference]: Without dead ends: 39 [2018-11-10 10:53:53,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:53:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-10 10:53:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-10 10:53:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 10:53:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-11-10 10:53:53,245 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-11-10 10:53:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:53,245 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-11-10 10:53:53,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:53:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-10 10:53:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 10:53:53,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:53,247 INFO L375 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, 1, 1, 1] [2018-11-10 10:53:53,247 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:53,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-10 10:53:53,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:53,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:53,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:53,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:53,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 10:53:53,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:53,311 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:53,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:53,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 10:53:53,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:53,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-11-10 10:53:53,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:53:53,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:53:53,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:53:53,403 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-11-10 10:53:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:53,537 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-11-10 10:53:53,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:53:53,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-10 10:53:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:53,539 INFO L225 Difference]: With dead ends: 70 [2018-11-10 10:53:53,539 INFO L226 Difference]: Without dead ends: 39 [2018-11-10 10:53:53,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-10 10:53:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-10 10:53:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-10 10:53:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 10:53:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-11-10 10:53:53,544 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-11-10 10:53:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:53,545 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-10 10:53:53,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:53:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-11-10 10:53:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 10:53:53,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:53,546 INFO L375 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, 1, 1, 1, 1] [2018-11-10 10:53:53,546 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:53,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:53,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-11-10 10:53:53,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:53,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:53,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 10:53:53,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:53,592 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:53,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:53,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 10:53:53,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:53,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-11-10 10:53:53,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:53:53,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:53:53,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:53:53,660 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-11-10 10:53:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:53,762 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-11-10 10:53:53,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:53:53,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-11-10 10:53:53,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:53,765 INFO L225 Difference]: With dead ends: 61 [2018-11-10 10:53:53,765 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 10:53:53,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:53:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 10:53:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-11-10 10:53:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 10:53:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-11-10 10:53:53,775 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-11-10 10:53:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:53,775 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-11-10 10:53:53,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:53:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-11-10 10:53:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 10:53:53,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:53,777 INFO L375 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, 1, 1, 1, 1] [2018-11-10 10:53:53,777 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:53,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:53,778 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-11-10 10:53:53,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:53,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:53,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:53,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:53,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 10:53:53,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:53,849 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:53,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:53,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 10:53:53,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:53,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-11-10 10:53:53,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:53:53,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:53:53,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:53:53,934 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-11-10 10:53:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:54,027 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-11-10 10:53:54,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:53:54,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-10 10:53:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:54,030 INFO L225 Difference]: With dead ends: 71 [2018-11-10 10:53:54,030 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 10:53:54,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:53:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 10:53:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-11-10 10:53:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 10:53:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-11-10 10:53:54,043 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-11-10 10:53:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:54,043 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-11-10 10:53:54,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:53:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-11-10 10:53:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 10:53:54,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:54,046 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:54,046 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:54,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-11-10 10:53:54,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:54,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:54,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-10 10:53:54,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:54,147 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:54,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 10:53:54,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:53:54,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:53:54,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 10:53:54,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:54,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-10 10:53:54,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 10:53:54,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 10:53:54,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-10 10:53:54,279 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 16 states. [2018-11-10 10:53:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:54,626 INFO L93 Difference]: Finished difference Result 146 states and 299 transitions. [2018-11-10 10:53:54,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 10:53:54,626 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-11-10 10:53:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:54,629 INFO L225 Difference]: With dead ends: 146 [2018-11-10 10:53:54,629 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 10:53:54,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-11-10 10:53:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 10:53:54,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-11-10 10:53:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-10 10:53:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 157 transitions. [2018-11-10 10:53:54,649 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 157 transitions. Word has length 80 [2018-11-10 10:53:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:54,649 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 157 transitions. [2018-11-10 10:53:54,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 10:53:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 157 transitions. [2018-11-10 10:53:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 10:53:54,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:54,652 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:54,652 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:54,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:54,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2012686571, now seen corresponding path program 2 times [2018-11-10 10:53:54,653 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:54,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:54,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:54,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:53:54,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 78 proven. 181 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2018-11-10 10:53:54,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:54,793 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:54,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 10:53:54,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:53:54,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:53:54,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 41 proven. 262 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2018-11-10 10:53:54,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:54,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-11-10 10:53:54,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 10:53:54,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 10:53:54,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:53:54,957 INFO L87 Difference]: Start difference. First operand 87 states and 157 transitions. Second operand 18 states. [2018-11-10 10:53:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:55,437 INFO L93 Difference]: Finished difference Result 232 states and 520 transitions. [2018-11-10 10:53:55,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 10:53:55,437 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 175 [2018-11-10 10:53:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:55,439 INFO L225 Difference]: With dead ends: 232 [2018-11-10 10:53:55,439 INFO L226 Difference]: Without dead ends: 129 [2018-11-10 10:53:55,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 10:53:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-10 10:53:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-11-10 10:53:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 10:53:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2018-11-10 10:53:55,457 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 175 [2018-11-10 10:53:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:55,458 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2018-11-10 10:53:55,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 10:53:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2018-11-10 10:53:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-11-10 10:53:55,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:55,464 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 22, 22, 22, 19, 16, 16, 16, 16, 16, 16, 16, 14, 11, 11, 11, 11, 11, 11, 11, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:55,465 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:55,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1497005454, now seen corresponding path program 1 times [2018-11-10 10:53:55,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:55,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:55,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:55,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:53:55,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 153 proven. 558 refuted. 0 times theorem prover too weak. 3427 trivial. 0 not checked. [2018-11-10 10:53:55,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:55,646 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:55,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:55,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 107 proven. 817 refuted. 0 times theorem prover too weak. 3214 trivial. 0 not checked. [2018-11-10 10:53:55,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:55,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2018-11-10 10:53:55,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 10:53:55,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 10:53:55,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:53:55,921 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand 18 states. [2018-11-10 10:53:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:56,417 INFO L93 Difference]: Finished difference Result 290 states and 587 transitions. [2018-11-10 10:53:56,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 10:53:56,420 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 378 [2018-11-10 10:53:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:56,423 INFO L225 Difference]: With dead ends: 290 [2018-11-10 10:53:56,423 INFO L226 Difference]: Without dead ends: 179 [2018-11-10 10:53:56,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2018-11-10 10:53:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-10 10:53:56,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 154. [2018-11-10 10:53:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-10 10:53:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 252 transitions. [2018-11-10 10:53:56,443 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 252 transitions. Word has length 378 [2018-11-10 10:53:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:56,444 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 252 transitions. [2018-11-10 10:53:56,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 10:53:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 252 transitions. [2018-11-10 10:53:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-11-10 10:53:56,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:56,456 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 36, 36, 36, 30, 22, 22, 22, 22, 22, 22, 22, 18, 18, 18, 18, 18, 18, 18, 18, 9, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:56,457 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:56,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash 510492843, now seen corresponding path program 1 times [2018-11-10 10:53:56,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:56,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:56,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:56,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:56,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9081 backedges. 412 proven. 678 refuted. 0 times theorem prover too weak. 7991 trivial. 0 not checked. [2018-11-10 10:53:56,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:56,721 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:56,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:56,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9081 backedges. 281 proven. 938 refuted. 0 times theorem prover too weak. 7862 trivial. 0 not checked. [2018-11-10 10:53:57,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:57,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-10 10:53:57,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 10:53:57,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 10:53:57,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:53:57,020 INFO L87 Difference]: Start difference. First operand 154 states and 252 transitions. Second operand 19 states. [2018-11-10 10:53:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:57,490 INFO L93 Difference]: Finished difference Result 415 states and 873 transitions. [2018-11-10 10:53:57,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 10:53:57,491 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 559 [2018-11-10 10:53:57,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:57,494 INFO L225 Difference]: With dead ends: 415 [2018-11-10 10:53:57,494 INFO L226 Difference]: Without dead ends: 260 [2018-11-10 10:53:57,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2018-11-10 10:53:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-10 10:53:57,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 201. [2018-11-10 10:53:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 10:53:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 378 transitions. [2018-11-10 10:53:57,516 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 378 transitions. Word has length 559 [2018-11-10 10:53:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:57,517 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 378 transitions. [2018-11-10 10:53:57,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 10:53:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 378 transitions. [2018-11-10 10:53:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-11-10 10:53:57,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:57,521 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 36, 36, 32, 31, 21, 21, 21, 21, 21, 21, 21, 18, 18, 18, 18, 18, 18, 18, 14, 11, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:57,521 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:57,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash -569589766, now seen corresponding path program 2 times [2018-11-10 10:53:57,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:57,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:57,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:57,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:53:57,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8545 backedges. 942 proven. 605 refuted. 0 times theorem prover too weak. 6998 trivial. 0 not checked. [2018-11-10 10:53:57,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:57,858 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:57,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 10:53:57,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:53:57,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:53:57,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8545 backedges. 466 proven. 986 refuted. 0 times theorem prover too weak. 7093 trivial. 0 not checked. [2018-11-10 10:53:58,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:58,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2018-11-10 10:53:58,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 10:53:58,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 10:53:58,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-11-10 10:53:58,171 INFO L87 Difference]: Start difference. First operand 201 states and 378 transitions. Second operand 24 states. [2018-11-10 10:53:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:58,757 INFO L93 Difference]: Finished difference Result 479 states and 1113 transitions. [2018-11-10 10:53:58,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 10:53:58,757 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 544 [2018-11-10 10:53:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:58,760 INFO L225 Difference]: With dead ends: 479 [2018-11-10 10:53:58,760 INFO L226 Difference]: Without dead ends: 235 [2018-11-10 10:53:58,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 10:53:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-10 10:53:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-11-10 10:53:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-10 10:53:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 347 transitions. [2018-11-10 10:53:58,780 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 347 transitions. Word has length 544 [2018-11-10 10:53:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:58,781 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 347 transitions. [2018-11-10 10:53:58,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 10:53:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 347 transitions. [2018-11-10 10:53:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-11-10 10:53:58,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:58,784 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 28, 28, 25, 23, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 11, 8, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:58,784 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:58,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash 315905302, now seen corresponding path program 3 times [2018-11-10 10:53:58,785 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:58,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:58,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:53:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 726 proven. 325 refuted. 0 times theorem prover too weak. 3658 trivial. 0 not checked. [2018-11-10 10:53:59,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:59,003 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:59,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:53:59,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-10 10:53:59,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:53:59,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:53:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 1605 proven. 69 refuted. 0 times theorem prover too weak. 3035 trivial. 0 not checked. [2018-11-10 10:53:59,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:53:59,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2018-11-10 10:53:59,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 10:53:59,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 10:53:59,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-11-10 10:53:59,285 INFO L87 Difference]: Start difference. First operand 232 states and 347 transitions. Second operand 23 states. [2018-11-10 10:53:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:53:59,750 INFO L93 Difference]: Finished difference Result 475 states and 752 transitions. [2018-11-10 10:53:59,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 10:53:59,751 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 409 [2018-11-10 10:53:59,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:53:59,753 INFO L225 Difference]: With dead ends: 475 [2018-11-10 10:53:59,753 INFO L226 Difference]: Without dead ends: 249 [2018-11-10 10:53:59,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=1464, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 10:53:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-10 10:53:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 237. [2018-11-10 10:53:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-10 10:53:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 328 transitions. [2018-11-10 10:53:59,771 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 328 transitions. Word has length 409 [2018-11-10 10:53:59,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:53:59,772 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 328 transitions. [2018-11-10 10:53:59,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 10:53:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 328 transitions. [2018-11-10 10:53:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-10 10:53:59,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:53:59,775 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 23, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:53:59,775 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:53:59,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:53:59,775 INFO L82 PathProgramCache]: Analyzing trace with hash 634662915, now seen corresponding path program 4 times [2018-11-10 10:53:59,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:53:59,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:53:59,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:59,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:53:59,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:53:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:53:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 547 proven. 151 refuted. 0 times theorem prover too weak. 3672 trivial. 0 not checked. [2018-11-10 10:53:59,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:53:59,944 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:53:59,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:54:00,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:54:00,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:54:00,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:54:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 655 proven. 176 refuted. 0 times theorem prover too weak. 3539 trivial. 0 not checked. [2018-11-10 10:54:00,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:54:00,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2018-11-10 10:54:00,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:54:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:54:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:54:00,137 INFO L87 Difference]: Start difference. First operand 237 states and 328 transitions. Second operand 12 states. [2018-11-10 10:54:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:54:00,257 INFO L93 Difference]: Finished difference Result 244 states and 334 transitions. [2018-11-10 10:54:00,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:54:00,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 395 [2018-11-10 10:54:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:54:00,259 INFO L225 Difference]: With dead ends: 244 [2018-11-10 10:54:00,259 INFO L226 Difference]: Without dead ends: 237 [2018-11-10 10:54:00,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:54:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-10 10:54:00,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-11-10 10:54:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-10 10:54:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 326 transitions. [2018-11-10 10:54:00,270 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 326 transitions. Word has length 395 [2018-11-10 10:54:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:54:00,270 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 326 transitions. [2018-11-10 10:54:00,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:54:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 326 transitions. [2018-11-10 10:54:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-11-10 10:54:00,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:54:00,274 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 40, 40, 33, 33, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 13, 12, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:54:00,274 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:54:00,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:54:00,274 INFO L82 PathProgramCache]: Analyzing trace with hash -829925372, now seen corresponding path program 5 times [2018-11-10 10:54:00,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:54:00,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:54:00,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:54:00,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:54:00,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:54:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:54:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9388 backedges. 739 proven. 438 refuted. 0 times theorem prover too weak. 8211 trivial. 0 not checked. [2018-11-10 10:54:00,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:54:00,521 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:54:00,526 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 10:54:00,606 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-10 10:54:00,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:54:00,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:54:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9388 backedges. 5278 proven. 176 refuted. 0 times theorem prover too weak. 3934 trivial. 0 not checked. [2018-11-10 10:54:00,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:54:00,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 19 [2018-11-10 10:54:00,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 10:54:00,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 10:54:00,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:54:00,908 INFO L87 Difference]: Start difference. First operand 237 states and 326 transitions. Second operand 19 states. [2018-11-10 10:54:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:54:01,315 INFO L93 Difference]: Finished difference Result 458 states and 656 transitions. [2018-11-10 10:54:01,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 10:54:01,316 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 571 [2018-11-10 10:54:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:54:01,319 INFO L225 Difference]: With dead ends: 458 [2018-11-10 10:54:01,319 INFO L226 Difference]: Without dead ends: 230 [2018-11-10 10:54:01,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 10:54:01,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-10 10:54:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 221. [2018-11-10 10:54:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-10 10:54:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 296 transitions. [2018-11-10 10:54:01,335 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 296 transitions. Word has length 571 [2018-11-10 10:54:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:54:01,335 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 296 transitions. [2018-11-10 10:54:01,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 10:54:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 296 transitions. [2018-11-10 10:54:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-11-10 10:54:01,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:54:01,343 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 35, 35, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 14, 13, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:54:01,343 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:54:01,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:54:01,343 INFO L82 PathProgramCache]: Analyzing trace with hash 141228388, now seen corresponding path program 6 times [2018-11-10 10:54:01,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:54:01,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:54:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:54:01,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:54:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:54:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:54:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10350 backedges. 1107 proven. 1012 refuted. 0 times theorem prover too weak. 8231 trivial. 0 not checked. [2018-11-10 10:54:01,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:54:01,709 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:54:01,722 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 10:54:01,829 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2018-11-10 10:54:01,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:54:01,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:54:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10350 backedges. 704 proven. 908 refuted. 0 times theorem prover too weak. 8738 trivial. 0 not checked. [2018-11-10 10:54:02,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:54:02,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 27 [2018-11-10 10:54:02,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 10:54:02,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 10:54:02,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2018-11-10 10:54:02,069 INFO L87 Difference]: Start difference. First operand 221 states and 296 transitions. Second operand 27 states. [2018-11-10 10:54:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:54:02,924 INFO L93 Difference]: Finished difference Result 448 states and 660 transitions. [2018-11-10 10:54:02,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-10 10:54:02,925 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 599 [2018-11-10 10:54:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:54:02,926 INFO L225 Difference]: With dead ends: 448 [2018-11-10 10:54:02,926 INFO L226 Difference]: Without dead ends: 193 [2018-11-10 10:54:02,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=437, Invalid=2643, Unknown=0, NotChecked=0, Total=3080 [2018-11-10 10:54:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-10 10:54:02,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 161. [2018-11-10 10:54:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-10 10:54:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 191 transitions. [2018-11-10 10:54:02,936 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 191 transitions. Word has length 599 [2018-11-10 10:54:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:54:02,936 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 191 transitions. [2018-11-10 10:54:02,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 10:54:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 191 transitions. [2018-11-10 10:54:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-11-10 10:54:02,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:54:02,938 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 25, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:54:02,938 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:54:02,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:54:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash -515597281, now seen corresponding path program 7 times [2018-11-10 10:54:02,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:54:02,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:54:02,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:54:02,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:54:02,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:54:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:54:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 385 proven. 976 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-11-10 10:54:03,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:54:03,113 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:54:03,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:54:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:54:03,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:54:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 397 proven. 499 refuted. 0 times theorem prover too weak. 4120 trivial. 0 not checked. [2018-11-10 10:54:03,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:54:03,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 23 [2018-11-10 10:54:03,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 10:54:03,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 10:54:03,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-11-10 10:54:03,301 INFO L87 Difference]: Start difference. First operand 161 states and 191 transitions. Second operand 23 states. [2018-11-10 10:54:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:54:03,896 INFO L93 Difference]: Finished difference Result 352 states and 438 transitions. [2018-11-10 10:54:03,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-10 10:54:03,896 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 422 [2018-11-10 10:54:03,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:54:03,897 INFO L225 Difference]: With dead ends: 352 [2018-11-10 10:54:03,898 INFO L226 Difference]: Without dead ends: 204 [2018-11-10 10:54:03,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=2538, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 10:54:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-10 10:54:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 166. [2018-11-10 10:54:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-10 10:54:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 192 transitions. [2018-11-10 10:54:03,912 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 192 transitions. Word has length 422 [2018-11-10 10:54:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:54:03,912 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 192 transitions. [2018-11-10 10:54:03,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 10:54:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2018-11-10 10:54:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-10 10:54:03,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:54:03,916 INFO L375 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, 1, 1, 1, 1] [2018-11-10 10:54:03,916 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:54:03,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:54:03,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 8 times [2018-11-10 10:54:03,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:54:03,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:54:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:54:03,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:54:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:54:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:54:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:54:03,998 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 10:54:04,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:54:04 BoogieIcfgContainer [2018-11-10 10:54:04,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:54:04,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:54:04,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:54:04,048 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:54:04,048 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:53:52" (3/4) ... [2018-11-10 10:54:04,050 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 10:54:04,125 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f5759725-9db3-4b1e-8dca-1c3bcfab1a17/bin-2019/uautomizer/witness.graphml [2018-11-10 10:54:04,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:54:04,126 INFO L168 Benchmark]: Toolchain (without parser) took 12218.41 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 841.0 MB). Free memory was 959.8 MB in the beginning and 846.1 MB in the end (delta: 113.7 MB). Peak memory consumption was 954.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:54:04,127 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:54:04,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.25 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:54:04,127 INFO L168 Benchmark]: Boogie Preprocessor took 22.92 ms. Allocated memory is still 1.0 GB. Free memory is still 949.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:54:04,127 INFO L168 Benchmark]: RCFGBuilder took 211.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 949.1 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:54:04,127 INFO L168 Benchmark]: TraceAbstraction took 11765.14 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 718.8 MB). Free memory was 1.1 GB in the beginning and 866.9 MB in the end (delta: 238.0 MB). Peak memory consumption was 956.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:54:04,128 INFO L168 Benchmark]: Witness Printer took 77.05 ms. Allocated memory is still 1.9 GB. Free memory was 866.9 MB in the beginning and 846.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:54:04,132 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.25 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.92 ms. Allocated memory is still 1.0 GB. Free memory is still 949.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 211.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 949.1 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11765.14 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 718.8 MB). Free memory was 1.1 GB in the beginning and 866.9 MB in the end (delta: 238.0 MB). Peak memory consumption was 956.8 MB. Max. memory is 11.5 GB. * Witness Printer took 77.05 ms. Allocated memory is still 1.9 GB. Free memory was 866.9 MB in the beginning and 846.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.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; VAL [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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] RET return fibo2(n-1) + fibo2(n-2); [L37] EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 11.7s OverallTime, 18 OverallIterations, 45 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 593 SDtfs, 1103 SDslu, 4536 SDs, 0 SdLazy, 7193 SolverSat, 1191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4725 GetRequests, 4282 SyntacticMatches, 2 SemanticMatches, 441 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3299 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 242 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 9126 NumberOfCodeBlocks, 8346 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 8631 ConstructedInterpolants, 0 QuantifiedInterpolants, 4768265 SizeOfPredicates, 92 NumberOfNonLiveVariables, 7845 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 103290/113198 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...