./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_5_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_5_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 c7b71b458b3f08f188a62c7539b715f43fd7f97d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:11:23,234 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:11:23,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:11:23,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:11:23,251 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:11:23,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:11:23,256 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:11:23,258 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:11:23,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:11:23,261 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:11:23,261 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:11:23,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:11:23,263 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:11:23,264 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:11:23,266 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:11:23,266 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:11:23,267 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:11:23,270 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:11:23,272 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:11:23,274 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:11:23,275 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:11:23,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:11:23,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:11:23,280 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:11:23,280 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:11:23,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:11:23,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:11:23,284 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:11:23,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:11:23,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:11:23,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:11:23,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:11:23,287 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:11:23,288 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:11:23,289 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:11:23,290 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:11:23,290 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:11:23,314 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:11:23,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:11:23,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:11:23,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:11:23,316 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:11:23,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:11:23,318 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:11:23,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:11:23,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:11:23,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:11:23,319 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:11:23,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:11:23,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:11:23,319 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:11:23,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:11:23,319 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:11:23,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:11:23,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:11:23,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:11:23,320 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:11:23,320 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:11:23,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:11:23,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:11:23,322 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:11:23,322 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:11:23,323 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:11:23,323 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:11:23,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:11:23,323 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> c7b71b458b3f08f188a62c7539b715f43fd7f97d [2019-01-12 15:11:23,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:11:23,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:11:23,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:11:23,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:11:23,392 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:11:23,393 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_5_true-unreach-call_true-termination.c [2019-01-12 15:11:23,454 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d4158062/8b86fb4a239345228d1f43c1c06d17af/FLAG74590f806 [2019-01-12 15:11:23,837 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:11:23,837 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_5_true-unreach-call_true-termination.c [2019-01-12 15:11:23,844 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d4158062/8b86fb4a239345228d1f43c1c06d17af/FLAG74590f806 [2019-01-12 15:11:24,242 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d4158062/8b86fb4a239345228d1f43c1c06d17af [2019-01-12 15:11:24,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:11:24,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:11:24,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:11:24,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:11:24,255 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:11:24,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:11:24" (1/1) ... [2019-01-12 15:11:24,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b00d126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24, skipping insertion in model container [2019-01-12 15:11:24,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:11:24" (1/1) ... [2019-01-12 15:11:24,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:11:24,295 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:11:24,481 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:11:24,488 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:11:24,509 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:11:24,528 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:11:24,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24 WrapperNode [2019-01-12 15:11:24,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:11:24,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:11:24,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:11:24,531 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:11:24,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24" (1/1) ... [2019-01-12 15:11:24,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24" (1/1) ... [2019-01-12 15:11:24,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:11:24,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:11:24,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:11:24,574 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:11:24,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24" (1/1) ... [2019-01-12 15:11:24,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24" (1/1) ... [2019-01-12 15:11:24,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24" (1/1) ... [2019-01-12 15:11:24,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24" (1/1) ... [2019-01-12 15:11:24,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24" (1/1) ... [2019-01-12 15:11:24,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24" (1/1) ... [2019-01-12 15:11:24,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24" (1/1) ... [2019-01-12 15:11:24,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:11:24,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:11:24,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:11:24,596 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:11:24,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:11:24,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:11:24,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:11:24,729 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-01-12 15:11:24,730 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-01-12 15:11:24,999 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:11:25,000 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:11:25,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:25 BoogieIcfgContainer [2019-01-12 15:11:25,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:11:25,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:11:25,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:11:25,005 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:11:25,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:11:24" (1/3) ... [2019-01-12 15:11:25,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f28c64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:11:25, skipping insertion in model container [2019-01-12 15:11:25,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:24" (2/3) ... [2019-01-12 15:11:25,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f28c64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:11:25, skipping insertion in model container [2019-01-12 15:11:25,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:25" (3/3) ... [2019-01-12 15:11:25,009 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_5_true-unreach-call_true-termination.c [2019-01-12 15:11:25,018 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:11:25,025 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:11:25,037 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:11:25,067 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:11:25,068 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:11:25,068 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:11:25,068 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:11:25,069 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:11:25,069 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:11:25,069 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:11:25,069 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:11:25,069 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:11:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-01-12 15:11:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:11:25,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:25,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:25,097 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:25,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1007516703, now seen corresponding path program 1 times [2019-01-12 15:11:25,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:25,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:25,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:25,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:25,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:11:25,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:25,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:25,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:25,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:25,442 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2019-01-12 15:11:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:25,606 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-01-12 15:11:25,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:25,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:11:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:25,618 INFO L225 Difference]: With dead ends: 29 [2019-01-12 15:11:25,619 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 15:11:25,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:11:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 15:11:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 15:11:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 15:11:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-12 15:11:25,665 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-01-12 15:11:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:25,666 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-12 15:11:25,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-01-12 15:11:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 15:11:25,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:25,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:25,669 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash -453503986, now seen corresponding path program 1 times [2019-01-12 15:11:25,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:25,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:25,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:25,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:25,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:11:25,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:25,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:25,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:25,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:25,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:25,761 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-01-12 15:11:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:25,973 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-01-12 15:11:25,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:25,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 15:11:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:25,975 INFO L225 Difference]: With dead ends: 23 [2019-01-12 15:11:25,975 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 15:11:25,977 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 [2019-01-12 15:11:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 15:11:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-12 15:11:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 15:11:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-12 15:11:25,983 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-01-12 15:11:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:25,984 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-12 15:11:25,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-01-12 15:11:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 15:11:25,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:25,985 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:25,986 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:25,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:25,986 INFO L82 PathProgramCache]: Analyzing trace with hash 511906889, now seen corresponding path program 1 times [2019-01-12 15:11:25,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:25,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:25,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:25,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:25,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 15:11:26,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:26,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 15:11:26,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:26,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 15:11:26,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:26,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-12 15:11:26,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:11:26,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:11:26,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:11:26,416 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2019-01-12 15:11:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:26,773 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-01-12 15:11:26,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:11:26,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-01-12 15:11:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:26,777 INFO L225 Difference]: With dead ends: 34 [2019-01-12 15:11:26,777 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 15:11:26,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:11:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 15:11:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-12 15:11:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 15:11:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-01-12 15:11:26,785 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2019-01-12 15:11:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:26,786 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-01-12 15:11:26,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:11:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-01-12 15:11:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 15:11:26,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:26,788 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:26,788 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:26,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:26,789 INFO L82 PathProgramCache]: Analyzing trace with hash 178931364, now seen corresponding path program 1 times [2019-01-12 15:11:26,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:26,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:26,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:26,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:26,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:11:26,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:26,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 15:11:27,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:27,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:11:27,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:27,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 15:11:27,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:11:27,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:11:27,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:11:27,074 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 6 states. [2019-01-12 15:11:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:27,396 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-01-12 15:11:27,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:11:27,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-12 15:11:27,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:27,400 INFO L225 Difference]: With dead ends: 28 [2019-01-12 15:11:27,403 INFO L226 Difference]: Without dead ends: 24 [2019-01-12 15:11:27,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:11:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-12 15:11:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-12 15:11:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 15:11:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-12 15:11:27,425 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2019-01-12 15:11:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:27,426 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-12 15:11:27,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:11:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-01-12 15:11:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:11:27,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:27,428 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:27,429 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:27,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:27,429 INFO L82 PathProgramCache]: Analyzing trace with hash 645818342, now seen corresponding path program 2 times [2019-01-12 15:11:27,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:27,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:27,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:27,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:27,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-12 15:11:27,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:27,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 15:11:27,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:11:27,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:11:27,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:27,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 15:11:27,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:27,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-01-12 15:11:27,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:11:27,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:11:27,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:11:27,691 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 8 states. [2019-01-12 15:11:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:27,990 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. [2019-01-12 15:11:27,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:11:27,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-01-12 15:11:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:27,994 INFO L225 Difference]: With dead ends: 36 [2019-01-12 15:11:27,994 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:11:27,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:11:27,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:11:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-12 15:11:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 15:11:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2019-01-12 15:11:28,005 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 36 [2019-01-12 15:11:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:28,006 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2019-01-12 15:11:28,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:11:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2019-01-12 15:11:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-12 15:11:28,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:28,010 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 8, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:28,010 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1193104726, now seen corresponding path program 3 times [2019-01-12 15:11:28,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:28,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:28,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 110 proven. 8 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-01-12 15:11:28,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:28,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 15:11:28,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:11:28,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 15:11:28,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:28,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 130 proven. 12 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-12 15:11:28,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:28,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-12 15:11:28,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:11:28,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:11:28,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:11:28,507 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 11 states. [2019-01-12 15:11:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:28,854 INFO L93 Difference]: Finished difference Result 61 states and 109 transitions. [2019-01-12 15:11:28,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:11:28,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2019-01-12 15:11:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:28,858 INFO L225 Difference]: With dead ends: 61 [2019-01-12 15:11:28,858 INFO L226 Difference]: Without dead ends: 34 [2019-01-12 15:11:28,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:11:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-12 15:11:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-12 15:11:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 15:11:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2019-01-12 15:11:28,870 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 77 [2019-01-12 15:11:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:28,870 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-01-12 15:11:28,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:11:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2019-01-12 15:11:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-12 15:11:28,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:28,874 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:28,874 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:28,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:28,875 INFO L82 PathProgramCache]: Analyzing trace with hash -91709127, now seen corresponding path program 4 times [2019-01-12 15:11:28,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:28,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:28,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:28,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:28,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-01-12 15:11:29,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:29,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 15:11:29,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:11:29,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:11:29,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:29,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-01-12 15:11:29,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:29,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2019-01-12 15:11:29,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:11:29,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:11:29,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:11:29,126 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 8 states. [2019-01-12 15:11:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:29,350 INFO L93 Difference]: Finished difference Result 40 states and 62 transitions. [2019-01-12 15:11:29,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:11:29,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-01-12 15:11:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:29,353 INFO L225 Difference]: With dead ends: 40 [2019-01-12 15:11:29,353 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 15:11:29,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:11:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 15:11:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-12 15:11:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 15:11:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2019-01-12 15:11:29,363 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 78 [2019-01-12 15:11:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:29,363 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2019-01-12 15:11:29,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:11:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2019-01-12 15:11:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-12 15:11:29,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:29,367 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 18, 10, 10, 10, 10, 10, 10, 10, 8, 3, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:29,367 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:29,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:29,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2138111439, now seen corresponding path program 5 times [2019-01-12 15:11:29,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:29,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:29,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:29,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 239 proven. 179 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2019-01-12 15:11:29,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:29,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 15:11:29,644 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:11:29,735 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-12 15:11:29,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:29,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 710 proven. 17 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2019-01-12 15:11:29,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:29,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2019-01-12 15:11:29,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:11:29,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:11:29,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:11:29,923 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 12 states. [2019-01-12 15:11:30,153 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-01-12 15:11:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:30,356 INFO L93 Difference]: Finished difference Result 84 states and 173 transitions. [2019-01-12 15:11:30,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:11:30,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 147 [2019-01-12 15:11:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:30,361 INFO L225 Difference]: With dead ends: 84 [2019-01-12 15:11:30,361 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 15:11:30,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-01-12 15:11:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 15:11:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2019-01-12 15:11:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 15:11:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2019-01-12 15:11:30,374 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 73 transitions. Word has length 147 [2019-01-12 15:11:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:30,375 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 73 transitions. [2019-01-12 15:11:30,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:11:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 73 transitions. [2019-01-12 15:11:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-12 15:11:30,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:30,378 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:30,379 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:30,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2413653, now seen corresponding path program 6 times [2019-01-12 15:11:30,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:30,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:30,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:30,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:30,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 241 proven. 102 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2019-01-12 15:11:30,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:30,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 15:11:30,731 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:11:30,789 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-01-12 15:11:30,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:30,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 259 proven. 59 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2019-01-12 15:11:30,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:30,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2019-01-12 15:11:30,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:11:30,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:11:30,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:11:30,900 INFO L87 Difference]: Start difference. First operand 44 states and 73 transitions. Second operand 12 states. [2019-01-12 15:11:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:31,297 INFO L93 Difference]: Finished difference Result 74 states and 166 transitions. [2019-01-12 15:11:31,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:11:31,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2019-01-12 15:11:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:31,301 INFO L225 Difference]: With dead ends: 74 [2019-01-12 15:11:31,302 INFO L226 Difference]: Without dead ends: 52 [2019-01-12 15:11:31,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:11:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-12 15:11:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-01-12 15:11:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 15:11:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2019-01-12 15:11:31,312 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 132 [2019-01-12 15:11:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:31,313 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2019-01-12 15:11:31,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:11:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2019-01-12 15:11:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-12 15:11:31,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:31,316 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 13, 7, 7, 7, 7, 7, 7, 7, 6, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:31,317 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:31,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:31,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1397221617, now seen corresponding path program 7 times [2019-01-12 15:11:31,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:31,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:31,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 124 proven. 74 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-01-12 15:11:31,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:31,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 15:11:31,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:31,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 115 proven. 123 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-01-12 15:11:31,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:31,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2019-01-12 15:11:31,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:11:31,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:11:31,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:11:31,955 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand 11 states. [2019-01-12 15:11:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:32,547 INFO L93 Difference]: Finished difference Result 117 states and 185 transitions. [2019-01-12 15:11:32,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 15:11:32,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2019-01-12 15:11:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:32,549 INFO L225 Difference]: With dead ends: 117 [2019-01-12 15:11:32,549 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 15:11:32,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-01-12 15:11:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 15:11:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 15:11:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 15:11:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-01-12 15:11:32,566 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 106 [2019-01-12 15:11:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:32,566 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-01-12 15:11:32,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:11:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-01-12 15:11:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 15:11:32,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:32,569 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:32,569 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:32,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:32,571 INFO L82 PathProgramCache]: Analyzing trace with hash 548614988, now seen corresponding path program 8 times [2019-01-12 15:11:32,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:32,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:32,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:32,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:32,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-01-12 15:11:33,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:33,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 15:11:33,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:11:33,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:11:33,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:33,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-01-12 15:11:33,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:33,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2019-01-12 15:11:33,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 15:11:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 15:11:33,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:11:33,667 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 20 states. [2019-01-12 15:11:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:33,900 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-01-12 15:11:33,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 15:11:33,901 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2019-01-12 15:11:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:33,903 INFO L225 Difference]: With dead ends: 57 [2019-01-12 15:11:33,903 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 15:11:33,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:11:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 15:11:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-01-12 15:11:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-12 15:11:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-01-12 15:11:33,910 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 105 [2019-01-12 15:11:33,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:33,911 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-01-12 15:11:33,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 15:11:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-01-12 15:11:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-12 15:11:33,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:33,917 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:33,917 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:33,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:33,918 INFO L82 PathProgramCache]: Analyzing trace with hash -470606863, now seen corresponding path program 9 times [2019-01-12 15:11:33,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:33,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:33,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:33,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:33,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 127 proven. 275 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2019-01-12 15:11:34,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:34,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:34,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:11:34,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-12 15:11:34,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:34,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 162 proven. 216 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2019-01-12 15:11:34,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:34,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 13 [2019-01-12 15:11:34,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 15:11:34,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 15:11:34,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:11:34,386 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 13 states. [2019-01-12 15:11:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:34,565 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-01-12 15:11:34,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:11:34,566 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2019-01-12 15:11:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:34,567 INFO L225 Difference]: With dead ends: 61 [2019-01-12 15:11:34,568 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:11:34,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:11:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:11:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:11:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:11:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:11:34,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2019-01-12 15:11:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:34,570 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:11:34,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 15:11:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:11:34,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:11:34,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:11:36,040 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2019-01-12 15:11:36,094 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:11:36,094 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:11:36,095 INFO L444 ceAbstractionStarter]: At program point L29(lines 23 30) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~x~0) [2019-01-12 15:11:36,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:11:36,095 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-12 15:11:36,095 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-01-12 15:11:36,095 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (and (<= 5 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 5)) [2019-01-12 15:11:36,095 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-01-12 15:11:36,095 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 28) no Hoare annotation was computed. [2019-01-12 15:11:36,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2019-01-12 15:11:36,096 INFO L448 ceAbstractionStarter]: For program point fiboEXIT(lines 5 13) no Hoare annotation was computed. [2019-01-12 15:11:36,096 INFO L448 ceAbstractionStarter]: For program point fiboFINAL(lines 5 13) no Hoare annotation was computed. [2019-01-12 15:11:36,096 INFO L444 ceAbstractionStarter]: At program point L11(line 11) the Hoare annotation is: (and (<= fibo_~n |fibo_#in~n|) (<= |fibo_#in~n| fibo_~n) (< 1 fibo_~n)) [2019-01-12 15:11:36,096 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-01-12 15:11:36,096 INFO L444 ceAbstractionStarter]: At program point L11-2(line 11) the Hoare annotation is: (let ((.cse2 (<= 3 fibo_~n)) (.cse3 (<= |fibo_#t~ret0| 1)) (.cse4 (<= 1 |fibo_#t~ret0|))) (let ((.cse0 (and .cse3 .cse4 (<= fibo_~n 2))) (.cse1 (and .cse3 (<= |fibo_#in~n| 3) .cse4 .cse2))) (and (or (<= 5 |fibo_#in~n|) .cse0 .cse1 (and (<= 2 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 2))) (<= fibo_~n |fibo_#in~n|) (or (< |fibo_#in~n| 3) .cse2) (or (and (<= 4 |fibo_#in~n|) (<= |fibo_#in~n| fibo_~n)) .cse0 .cse1) (or (<= 6 |fibo_#in~n|) (<= |fibo_#in~n| 4) (and (<= 3 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 3))) (< 1 fibo_~n)))) [2019-01-12 15:11:36,097 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 12) no Hoare annotation was computed. [2019-01-12 15:11:36,097 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2019-01-12 15:11:36,097 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 12) no Hoare annotation was computed. [2019-01-12 15:11:36,097 INFO L451 ceAbstractionStarter]: At program point fiboENTRY(lines 5 13) the Hoare annotation is: true [2019-01-12 15:11:36,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:11:36 BoogieIcfgContainer [2019-01-12 15:11:36,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:11:36,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:11:36,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:11:36,113 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:11:36,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:25" (3/4) ... [2019-01-12 15:11:36,118 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:11:36,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo [2019-01-12 15:11:36,129 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:11:36,129 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:11:36,176 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:11:36,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:11:36,177 INFO L168 Benchmark]: Toolchain (without parser) took 11929.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 267.4 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -61.2 MB). Peak memory consumption was 206.2 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:36,178 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:36,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.90 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:36,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.84 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:36,180 INFO L168 Benchmark]: Boogie Preprocessor took 21.26 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:36,180 INFO L168 Benchmark]: RCFGBuilder took 405.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:36,181 INFO L168 Benchmark]: TraceAbstraction took 11110.79 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.5 MB). Peak memory consumption was 232.0 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:36,182 INFO L168 Benchmark]: Witness Printer took 62.90 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: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-12 15:11:36,186 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.90 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 42.84 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.26 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 405.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11110.79 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.5 MB). Peak memory consumption was 232.0 MB. Max. memory is 11.5 GB. * Witness Printer took 62.90 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: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 5 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. SAFE Result, 11.0s OverallTime, 12 OverallIterations, 21 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 213 SDtfs, 224 SDslu, 727 SDs, 0 SdLazy, 1012 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1025 GetRequests, 876 SyntacticMatches, 9 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=9, 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 17 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 101 PreInvPairs, 357 NumberOfFragments, 117 HoareAnnotationTreeSize, 101 FomulaSimplifications, 4428 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 867 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1735 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1713 ConstructedInterpolants, 0 QuantifiedInterpolants, 340985 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1603 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 8000/9694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...