./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/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 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0cd3be1 [2018-11-28 11:34:14,415 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:34:14,416 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:34:14,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:34:14,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:34:14,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:34:14,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:34:14,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:34:14,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:34:14,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:34:14,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:34:14,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:34:14,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:34:14,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:34:14,431 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:34:14,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:34:14,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:34:14,433 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:34:14,435 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:34:14,436 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:34:14,437 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:34:14,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:34:14,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:34:14,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:34:14,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:34:14,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:34:14,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:34:14,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:34:14,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:34:14,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:34:14,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:34:14,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:34:14,444 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:34:14,444 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:34:14,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:34:14,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:34:14,445 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:34:14,453 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:34:14,453 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:34:14,453 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:34:14,453 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:34:14,454 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:34:14,454 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:34:14,454 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:34:14,454 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:34:14,455 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:34:14,455 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:34:14,455 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:34:14,455 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:34:14,455 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:34:14,455 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:34:14,455 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:34:14,455 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:34:14,456 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:34:14,456 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:34:14,456 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:34:14,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:34:14,456 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:34:14,456 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:34:14,456 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:34:14,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:34:14,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:34:14,457 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:34:14,457 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:34:14,457 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:34:14,457 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:34:14,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:34:14,458 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_852f5921-9732-4e77-a125-0b5524db1962/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 -> 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 [2018-11-28 11:34:14,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:34:14,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:34:14,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:34:14,498 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:34:14,498 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:34:14,499 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-11-28 11:34:14,543 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/bin-2019/uautomizer/data/e1de35065/bb7c20c6131f4b3f9cbd716f2f591045/FLAG8128078bf [2018-11-28 11:34:14,931 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:34:14,931 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-11-28 11:34:14,935 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/bin-2019/uautomizer/data/e1de35065/bb7c20c6131f4b3f9cbd716f2f591045/FLAG8128078bf [2018-11-28 11:34:14,950 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/bin-2019/uautomizer/data/e1de35065/bb7c20c6131f4b3f9cbd716f2f591045 [2018-11-28 11:34:14,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:34:14,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:34:14,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:34:14,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:34:14,956 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:34:14,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:34:14" (1/1) ... [2018-11-28 11:34:14,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e964f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:14, skipping insertion in model container [2018-11-28 11:34:14,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:34:14" (1/1) ... [2018-11-28 11:34:14,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:34:14,974 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:34:15,061 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:34:15,064 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:34:15,072 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:34:15,080 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:34:15,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:15 WrapperNode [2018-11-28 11:34:15,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:34:15,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:34:15,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:34:15,082 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:34:15,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:15" (1/1) ... [2018-11-28 11:34:15,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:15" (1/1) ... [2018-11-28 11:34:15,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:34:15,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:34:15,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:34:15,095 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:34:15,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:15" (1/1) ... [2018-11-28 11:34:15,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:15" (1/1) ... [2018-11-28 11:34:15,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:15" (1/1) ... [2018-11-28 11:34:15,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:15" (1/1) ... [2018-11-28 11:34:15,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:15" (1/1) ... [2018-11-28 11:34:15,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:15" (1/1) ... [2018-11-28 11:34:15,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:15" (1/1) ... [2018-11-28 11:34:15,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:34:15,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:34:15,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:34:15,107 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:34:15,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/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-28 11:34:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:34:15,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:34:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:34:15,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:34:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:34:15,190 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:34:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-28 11:34:15,190 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-28 11:34:15,304 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:34:15,304 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 11:34:15,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:15 BoogieIcfgContainer [2018-11-28 11:34:15,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:34:15,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:34:15,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:34:15,308 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:34:15,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:34:14" (1/3) ... [2018-11-28 11:34:15,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de512a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:34:15, skipping insertion in model container [2018-11-28 11:34:15,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:15" (2/3) ... [2018-11-28 11:34:15,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de512a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:34:15, skipping insertion in model container [2018-11-28 11:34:15,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:15" (3/3) ... [2018-11-28 11:34:15,310 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7_false-unreach-call_true-termination.c [2018-11-28 11:34:15,317 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:34:15,323 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:34:15,336 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:34:15,364 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:34:15,365 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:34:15,365 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:34:15,365 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:34:15,365 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:34:15,365 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:34:15,365 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:34:15,366 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:34:15,366 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:34:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-28 11:34:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 11:34:15,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:34:15,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:34:15,386 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:34:15,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:34:15,390 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2018-11-28 11:34:15,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:34:15,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:34:15,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:15,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:34:15,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:15,534 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-28 11:34:15,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:34:15,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:34:15,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:34:15,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:34:15,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:34:15,556 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-28 11:34:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:34:15,620 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-28 11:34:15,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:34:15,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 11:34:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:34:15,631 INFO L225 Difference]: With dead ends: 35 [2018-11-28 11:34:15,631 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 11:34:15,634 INFO L631 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-28 11:34:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 11:34:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 11:34:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 11:34:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-28 11:34:15,663 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-11-28 11:34:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:34:15,663 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 11:34:15,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:34:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-28 11:34:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 11:34:15,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:34:15,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:34:15,665 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:34:15,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:34:15,666 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2018-11-28 11:34:15,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:34:15,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:34:15,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:15,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:34:15,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:15,706 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-28 11:34:15,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:34:15,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:34:15,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:34:15,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:34:15,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:34:15,708 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-28 11:34:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:34:15,775 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-28 11:34:15,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:34:15,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 11:34:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:34:15,777 INFO L225 Difference]: With dead ends: 27 [2018-11-28 11:34:15,777 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 11:34:15,777 INFO L631 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-28 11:34:15,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 11:34:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-28 11:34:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 11:34:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-28 11:34:15,783 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-11-28 11:34:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:34:15,783 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 11:34:15,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:34:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-28 11:34:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:34:15,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:34:15,784 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:34:15,784 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:34:15,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:34:15,785 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2018-11-28 11:34:15,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:34:15,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:34:15,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:15,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:34:15,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:34:15,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:34:15,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/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-28 11:34:15,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:34:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:15,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:34:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:34:15,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:34:15,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-28 11:34:15,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:34:15,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:34:15,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:34:15,967 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-11-28 11:34:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:34:16,063 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-28 11:34:16,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:34:16,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-28 11:34:16,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:34:16,065 INFO L225 Difference]: With dead ends: 38 [2018-11-28 11:34:16,065 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 11:34:16,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:34:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 11:34:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 11:34:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 11:34:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-28 11:34:16,071 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-11-28 11:34:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:34:16,071 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-28 11:34:16,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:34:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-28 11:34:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:34:16,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:34:16,072 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:34:16,072 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:34:16,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:34:16,073 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2018-11-28 11:34:16,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:34:16,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:34:16,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:16,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:34:16,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:34:16,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:34:16,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/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-28 11:34:16,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:34:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:16,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:34:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:34:16,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:34:16,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 11:34:16,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:34:16,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:34:16,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:34:16,170 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-28 11:34:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:34:16,224 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-28 11:34:16,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:34:16,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-28 11:34:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:34:16,226 INFO L225 Difference]: With dead ends: 32 [2018-11-28 11:34:16,226 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 11:34:16,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:34:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 11:34:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 11:34:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 11:34:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-28 11:34:16,233 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-11-28 11:34:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:34:16,233 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-28 11:34:16,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:34:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-28 11:34:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 11:34:16,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:34:16,234 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:34:16,234 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:34:16,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:34:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2018-11-28 11:34:16,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:34:16,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:34:16,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:16,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:34:16,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 11:34:16,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:34:16,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/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-28 11:34:16,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:34:16,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:34:16,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:34:16,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:34:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 11:34:16,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:34:16,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-11-28 11:34:16,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:34:16,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:34:16,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:34:16,374 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 8 states. [2018-11-28 11:34:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:34:16,470 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2018-11-28 11:34:16,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:34:16,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-28 11:34:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:34:16,472 INFO L225 Difference]: With dead ends: 40 [2018-11-28 11:34:16,472 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 11:34:16,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:34:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 11:34:16,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-28 11:34:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 11:34:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-28 11:34:16,480 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-11-28 11:34:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:34:16,480 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-28 11:34:16,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:34:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-11-28 11:34:16,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 11:34:16,483 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:34:16,483 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:34:16,483 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:34:16,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:34:16,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2018-11-28 11:34:16,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:34:16,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:34:16,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:16,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:34:16,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-11-28 11:34:16,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:34:16,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/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-28 11:34:16,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:34:16,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-28 11:34:16,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:34:16,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:34:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-11-28 11:34:16,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:34:16,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-11-28 11:34:16,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:34:16,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:34:16,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:34:16,714 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-11-28 11:34:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:34:16,894 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-11-28 11:34:16,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:34:16,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-11-28 11:34:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:34:16,896 INFO L225 Difference]: With dead ends: 76 [2018-11-28 11:34:16,896 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 11:34:16,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-28 11:34:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 11:34:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-28 11:34:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 11:34:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-11-28 11:34:16,905 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-11-28 11:34:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:34:16,906 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-11-28 11:34:16,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:34:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-11-28 11:34:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 11:34:16,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:34:16,908 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:34:16,909 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:34:16,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:34:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 4 times [2018-11-28 11:34:16,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:34:16,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:34:16,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:16,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:34:16,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-28 11:34:16,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:34:16,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/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-28 11:34:16,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 11:34:16,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 11:34:16,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:34:16,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:34:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-28 11:34:17,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:34:17,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-11-28 11:34:17,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:34:17,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:34:17,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:34:17,042 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 8 states. [2018-11-28 11:34:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:34:17,122 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2018-11-28 11:34:17,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:34:17,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-11-28 11:34:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:34:17,124 INFO L225 Difference]: With dead ends: 52 [2018-11-28 11:34:17,124 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 11:34:17,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:34:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 11:34:17,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-28 11:34:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 11:34:17,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-11-28 11:34:17,132 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 68 [2018-11-28 11:34:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:34:17,133 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2018-11-28 11:34:17,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:34:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2018-11-28 11:34:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-28 11:34:17,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:34:17,135 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:34:17,135 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:34:17,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:34:17,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2018-11-28 11:34:17,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:34:17,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:34:17,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:17,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:34:17,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-11-28 11:34:17,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:34:17,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/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-28 11:34:17,240 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 11:34:17,266 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-28 11:34:17,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:34:17,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:34:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 336 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2018-11-28 11:34:17,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:34:17,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 14 [2018-11-28 11:34:17,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:34:17,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:34:17,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:34:17,363 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 14 states. [2018-11-28 11:34:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:34:17,607 INFO L93 Difference]: Finished difference Result 118 states and 229 transitions. [2018-11-28 11:34:17,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 11:34:17,607 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 136 [2018-11-28 11:34:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:34:17,608 INFO L225 Difference]: With dead ends: 118 [2018-11-28 11:34:17,609 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 11:34:17,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2018-11-28 11:34:17,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 11:34:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-28 11:34:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 11:34:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2018-11-28 11:34:17,618 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 136 [2018-11-28 11:34:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:34:17,618 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2018-11-28 11:34:17,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:34:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2018-11-28 11:34:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-28 11:34:17,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:34:17,621 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:34:17,623 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:34:17,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:34:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash -509498553, now seen corresponding path program 6 times [2018-11-28 11:34:17,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:34:17,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:34:17,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:17,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:34:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 669 proven. 122 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2018-11-28 11:34:17,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:34:17,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/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-28 11:34:17,805 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 11:34:17,856 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-11-28 11:34:17,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:34:17,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:34:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 236 proven. 396 refuted. 0 times theorem prover too weak. 1609 trivial. 0 not checked. [2018-11-28 11:34:17,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:34:17,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2018-11-28 11:34:17,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 11:34:17,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 11:34:17,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-11-28 11:34:17,967 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand 18 states. [2018-11-28 11:34:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:34:18,448 INFO L93 Difference]: Finished difference Result 163 states and 256 transitions. [2018-11-28 11:34:18,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-28 11:34:18,449 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 204 [2018-11-28 11:34:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:34:18,450 INFO L225 Difference]: With dead ends: 163 [2018-11-28 11:34:18,450 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 11:34:18,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=422, Invalid=1470, Unknown=0, NotChecked=0, Total=1892 [2018-11-28 11:34:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 11:34:18,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2018-11-28 11:34:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 11:34:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2018-11-28 11:34:18,460 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 204 [2018-11-28 11:34:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:34:18,460 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2018-11-28 11:34:18,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 11:34:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2018-11-28 11:34:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-28 11:34:18,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:34:18,466 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:34:18,466 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:34:18,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:34:18,466 INFO L82 PathProgramCache]: Analyzing trace with hash 223191898, now seen corresponding path program 7 times [2018-11-28 11:34:18,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:34:18,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:34:18,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:18,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:34:18,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1015 proven. 551 refuted. 0 times theorem prover too weak. 5554 trivial. 0 not checked. [2018-11-28 11:34:18,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:34:18,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/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-28 11:34:18,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:34:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:18,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:34:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1021 proven. 540 refuted. 0 times theorem prover too weak. 5559 trivial. 0 not checked. [2018-11-28 11:34:18,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:34:18,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-11-28 11:34:18,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:34:18,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:34:18,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:34:18,852 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand 14 states. [2018-11-28 11:34:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:34:18,950 INFO L93 Difference]: Finished difference Result 107 states and 161 transitions. [2018-11-28 11:34:18,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:34:18,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 354 [2018-11-28 11:34:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:34:18,952 INFO L225 Difference]: With dead ends: 107 [2018-11-28 11:34:18,952 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 11:34:18,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-11-28 11:34:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 11:34:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-28 11:34:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 11:34:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2018-11-28 11:34:18,960 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 354 [2018-11-28 11:34:18,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:34:18,961 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-11-28 11:34:18,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:34:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2018-11-28 11:34:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-28 11:34:18,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:34:18,964 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 28, 17, 17, 17, 17, 17, 17, 17, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:34:18,965 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:34:18,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:34:18,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1660049266, now seen corresponding path program 8 times [2018-11-28 11:34:18,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:34:18,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:34:18,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:18,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:34:18,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:34:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 517 proven. 138 refuted. 0 times theorem prover too weak. 2647 trivial. 0 not checked. [2018-11-28 11:34:19,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:34:19,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/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-28 11:34:19,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:34:19,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:34:19,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:34:19,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:34:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 638 proven. 173 refuted. 0 times theorem prover too weak. 2491 trivial. 0 not checked. [2018-11-28 11:34:19,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:34:19,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-11-28 11:34:19,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:34:19,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:34:19,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:34:19,151 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand 9 states. [2018-11-28 11:34:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:34:19,248 INFO L93 Difference]: Finished difference Result 97 states and 124 transitions. [2018-11-28 11:34:19,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:34:19,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 245 [2018-11-28 11:34:19,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:34:19,249 INFO L225 Difference]: With dead ends: 97 [2018-11-28 11:34:19,249 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 11:34:19,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:34:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 11:34:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-11-28 11:34:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 11:34:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2018-11-28 11:34:19,259 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 245 [2018-11-28 11:34:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:34:19,260 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-11-28 11:34:19,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:34:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2018-11-28 11:34:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-28 11:34:19,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:34:19,263 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:34:19,263 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:34:19,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:34:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 9 times [2018-11-28 11:34:19,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:34:19,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:34:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:19,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:34:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:34:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:34:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:34:19,307 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:34:19,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:34:19 BoogieIcfgContainer [2018-11-28 11:34:19,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:34:19,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:34:19,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:34:19,350 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:34:19,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:15" (3/4) ... [2018-11-28 11:34:19,352 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 11:34:19,412 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_852f5921-9732-4e77-a125-0b5524db1962/bin-2019/uautomizer/witness.graphml [2018-11-28 11:34:19,413 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:34:19,413 INFO L168 Benchmark]: Toolchain (without parser) took 4461.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 956.7 MB in the beginning and 1.0 GB in the end (delta: -63.8 MB). Peak memory consumption was 158.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:34:19,414 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:34:19,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 128.02 ms. Allocated memory is still 1.0 GB. Free memory was 956.7 MB in the beginning and 945.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:34:19,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.31 ms. Allocated memory is still 1.0 GB. Free memory is still 945.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:34:19,415 INFO L168 Benchmark]: Boogie Preprocessor took 11.86 ms. Allocated memory is still 1.0 GB. Free memory is still 945.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:34:19,415 INFO L168 Benchmark]: RCFGBuilder took 197.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:34:19,415 INFO L168 Benchmark]: TraceAbstraction took 4044.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.7 MB). Peak memory consumption was 180.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:34:19,415 INFO L168 Benchmark]: Witness Printer took 63.09 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:34:19,417 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 128.02 ms. Allocated memory is still 1.0 GB. Free memory was 956.7 MB in the beginning and 945.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.31 ms. Allocated memory is still 1.0 GB. Free memory is still 945.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.86 ms. Allocated memory is still 1.0 GB. Free memory is still 945.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 197.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4044.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.7 MB). Peak memory consumption was 180.6 MB. Max. memory is 11.5 GB. * Witness Printer took 63.09 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. UNSAFE Result, 3.9s OverallTime, 12 OverallIterations, 51 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 230 SDtfs, 386 SDslu, 701 SDs, 0 SdLazy, 1166 SolverSat, 426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1370 GetRequests, 1209 SyntacticMatches, 2 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=10, 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.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 26 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2705 NumberOfCodeBlocks, 2581 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 2399 ConstructedInterpolants, 0 QuantifiedInterpolants, 709251 SizeOfPredicates, 46 NumberOfNonLiveVariables, 2393 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 25863/28568 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...