./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_7_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_7_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 f612eebc128d68e9b4bc81ed92184f640c3b9bd4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:35,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:11:35,348 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:11:35,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:11:35,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:11:35,362 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:11:35,363 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:11:35,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:11:35,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:11:35,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:11:35,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:11:35,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:11:35,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:11:35,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:11:35,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:11:35,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:11:35,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:11:35,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:11:35,385 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:11:35,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:11:35,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:11:35,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:11:35,392 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:11:35,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:11:35,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:11:35,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:11:35,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:11:35,396 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:11:35,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:11:35,398 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:11:35,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:11:35,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:11:35,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:11:35,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:11:35,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:11:35,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:11:35,402 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:35,417 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:11:35,418 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:11:35,419 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:11:35,420 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:11:35,420 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:11:35,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:11:35,420 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:11:35,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:11:35,421 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:11:35,421 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:11:35,421 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:11:35,421 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:11:35,421 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:11:35,421 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:11:35,422 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:11:35,423 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:11:35,423 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:11:35,423 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:11:35,424 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:11:35,424 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:11:35,424 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:11:35,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:11:35,424 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:11:35,424 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:11:35,425 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:11:35,426 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:11:35,426 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:11:35,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:11:35,426 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 -> f612eebc128d68e9b4bc81ed92184f640c3b9bd4 [2019-01-12 15:11:35,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:11:35,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:11:35,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:11:35,495 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:11:35,497 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:11:35,499 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_7_true-unreach-call_true-termination.c [2019-01-12 15:11:35,562 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193936018/f773e9002a21412f839e464b3b63b175/FLAG756f72829 [2019-01-12 15:11:35,955 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:11:35,955 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_7_true-unreach-call_true-termination.c [2019-01-12 15:11:35,962 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193936018/f773e9002a21412f839e464b3b63b175/FLAG756f72829 [2019-01-12 15:11:36,329 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193936018/f773e9002a21412f839e464b3b63b175 [2019-01-12 15:11:36,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:11:36,335 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:11:36,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:11:36,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:11:36,340 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:11:36,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:11:36" (1/1) ... [2019-01-12 15:11:36,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@437db60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:36, skipping insertion in model container [2019-01-12 15:11:36,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:11:36" (1/1) ... [2019-01-12 15:11:36,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:11:36,372 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:11:36,520 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:11:36,524 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:11:36,538 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:11:36,551 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:11:36,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:36 WrapperNode [2019-01-12 15:11:36,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:11:36,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:11:36,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:11:36,553 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:11:36,562 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:36" (1/1) ... [2019-01-12 15:11:36,566 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:36" (1/1) ... [2019-01-12 15:11:36,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:11:36,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:11:36,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:11:36,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:11:36,590 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:36" (1/1) ... [2019-01-12 15:11:36,590 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:36" (1/1) ... [2019-01-12 15:11:36,591 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:36" (1/1) ... [2019-01-12 15:11:36,591 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:36" (1/1) ... [2019-01-12 15:11:36,593 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:36" (1/1) ... [2019-01-12 15:11:36,595 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:36" (1/1) ... [2019-01-12 15:11:36,595 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:36" (1/1) ... [2019-01-12 15:11:36,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:11:36,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:11:36,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:11:36,597 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:11:36,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:36" (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:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:11:36,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:11:36,713 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-01-12 15:11:36,713 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-01-12 15:11:36,948 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:11:36,948 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:11:36,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:36 BoogieIcfgContainer [2019-01-12 15:11:36,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:11:36,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:11:36,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:11:36,965 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:11:36,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:11:36" (1/3) ... [2019-01-12 15:11:36,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f2dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:11:36, skipping insertion in model container [2019-01-12 15:11:36,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:36" (2/3) ... [2019-01-12 15:11:36,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f2dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:11:36, skipping insertion in model container [2019-01-12 15:11:36,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:36" (3/3) ... [2019-01-12 15:11:36,980 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7_true-unreach-call_true-termination.c [2019-01-12 15:11:37,012 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:11:37,030 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:11:37,052 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:11:37,093 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:11:37,094 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:11:37,094 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:11:37,094 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:11:37,095 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:11:37,095 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:11:37,095 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:11:37,095 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:11:37,095 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:11:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-01-12 15:11:37,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:11:37,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:37,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:37,126 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:37,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1007516703, now seen corresponding path program 1 times [2019-01-12 15:11:37,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:37,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:37,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:37,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:37,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:37,317 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:37,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:37,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:37,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:37,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:37,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:37,339 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2019-01-12 15:11:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:37,495 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-01-12 15:11:37,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:37,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:11:37,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:37,506 INFO L225 Difference]: With dead ends: 29 [2019-01-12 15:11:37,506 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 15:11:37,510 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:37,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 15:11:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 15:11:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 15:11:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-12 15:11:37,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-01-12 15:11:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:37,554 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-12 15:11:37,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-01-12 15:11:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 15:11:37,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:37,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:37,557 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:37,561 INFO L82 PathProgramCache]: Analyzing trace with hash -453503986, now seen corresponding path program 1 times [2019-01-12 15:11:37,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:37,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:37,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:37,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:37,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:37,821 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:37,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:37,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:37,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:37,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:37,826 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-01-12 15:11:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:38,093 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-01-12 15:11:38,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:38,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 15:11:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:38,095 INFO L225 Difference]: With dead ends: 23 [2019-01-12 15:11:38,095 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 15:11:38,096 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:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 15:11:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-12 15:11:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 15:11:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-12 15:11:38,103 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-01-12 15:11:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:38,104 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-12 15:11:38,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-01-12 15:11:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 15:11:38,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:38,106 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:38,106 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash 511906889, now seen corresponding path program 1 times [2019-01-12 15:11:38,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:38,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:38,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:38,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:38,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:38,301 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:38,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:38,302 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:38,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:38,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:38,466 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:38,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:38,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-12 15:11:38,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:11:38,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:11:38,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:11:38,493 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2019-01-12 15:11:38,687 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-12 15:11:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:38,844 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-01-12 15:11:38,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:11:38,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-01-12 15:11:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:38,846 INFO L225 Difference]: With dead ends: 34 [2019-01-12 15:11:38,846 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 15:11:38,850 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:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 15:11:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-12 15:11:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 15:11:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-01-12 15:11:38,863 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2019-01-12 15:11:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:38,864 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-01-12 15:11:38,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:11:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-01-12 15:11:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 15:11:38,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:38,868 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:38,869 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:38,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:38,869 INFO L82 PathProgramCache]: Analyzing trace with hash 178931364, now seen corresponding path program 1 times [2019-01-12 15:11:38,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:38,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:38,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:38,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:39,026 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:39,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:39,027 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:39,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:39,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:39,092 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:39,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:39,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 15:11:39,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:11:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:11:39,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:11:39,116 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 6 states. [2019-01-12 15:11:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:39,441 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-01-12 15:11:39,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:11:39,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-12 15:11:39,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:39,446 INFO L225 Difference]: With dead ends: 28 [2019-01-12 15:11:39,446 INFO L226 Difference]: Without dead ends: 24 [2019-01-12 15:11:39,447 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:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-12 15:11:39,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-12 15:11:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 15:11:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-12 15:11:39,462 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2019-01-12 15:11:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:39,463 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-12 15:11:39,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:11:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-01-12 15:11:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:11:39,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:39,467 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:39,468 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:39,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:39,468 INFO L82 PathProgramCache]: Analyzing trace with hash 645818342, now seen corresponding path program 2 times [2019-01-12 15:11:39,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:39,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:39,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:39,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:39,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:39,695 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:39,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:39,696 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:39,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:11:39,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:11:39,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:39,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:39,827 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:39,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:39,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-01-12 15:11:39,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:11:39,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:11:39,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:11:39,857 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 8 states. [2019-01-12 15:11:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:40,095 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. [2019-01-12 15:11:40,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:11:40,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-01-12 15:11:40,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:40,099 INFO L225 Difference]: With dead ends: 36 [2019-01-12 15:11:40,100 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:11:40,100 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:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:11:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-12 15:11:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 15:11:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2019-01-12 15:11:40,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 36 [2019-01-12 15:11:40,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:40,112 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2019-01-12 15:11:40,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:11:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2019-01-12 15:11:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-12 15:11:40,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:40,116 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:40,116 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:40,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:40,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1193104726, now seen corresponding path program 3 times [2019-01-12 15:11:40,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:40,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:40,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:40,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:40,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:40,383 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:40,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:40,384 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:40,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:11:40,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 15:11:40,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:40,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:40,577 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:40,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:40,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-12 15:11:40,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:11:40,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:11:40,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:11:40,604 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 11 states. [2019-01-12 15:11:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:40,969 INFO L93 Difference]: Finished difference Result 61 states and 109 transitions. [2019-01-12 15:11:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:11:40,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2019-01-12 15:11:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:40,973 INFO L225 Difference]: With dead ends: 61 [2019-01-12 15:11:40,973 INFO L226 Difference]: Without dead ends: 34 [2019-01-12 15:11:40,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:11:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-12 15:11:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-12 15:11:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 15:11:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2019-01-12 15:11:40,986 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 77 [2019-01-12 15:11:40,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:40,987 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-01-12 15:11:40,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:11:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2019-01-12 15:11:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 15:11:40,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:40,989 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:40,990 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:40,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1472518942, now seen corresponding path program 4 times [2019-01-12 15:11:40,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:40,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:40,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:40,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:40,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-01-12 15:11:41,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:41,098 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:41,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:11:41,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:11:41,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:41,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-01-12 15:11:41,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:41,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2019-01-12 15:11:41,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:11:41,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:11:41,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:11:41,375 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 8 states. [2019-01-12 15:11:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:41,579 INFO L93 Difference]: Finished difference Result 40 states and 62 transitions. [2019-01-12 15:11:41,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:11:41,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-01-12 15:11:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:41,585 INFO L225 Difference]: With dead ends: 40 [2019-01-12 15:11:41,585 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 15:11:41,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:11:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 15:11:41,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-12 15:11:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 15:11:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2019-01-12 15:11:41,599 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 64 [2019-01-12 15:11:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:41,601 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2019-01-12 15:11:41,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:11:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2019-01-12 15:11:41,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-12 15:11:41,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:41,606 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:41,607 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:41,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:41,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1256539154, now seen corresponding path program 5 times [2019-01-12 15:11:41,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:41,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:41,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:41,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:41,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 319 proven. 55 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-01-12 15:11:41,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:41,960 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:41,976 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:11:42,271 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-01-12 15:11:42,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:42,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 353 proven. 303 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2019-01-12 15:11:42,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:42,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 17 [2019-01-12 15:11:42,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 15:11:42,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 15:11:42,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-01-12 15:11:42,785 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 17 states. [2019-01-12 15:11:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:44,010 INFO L93 Difference]: Finished difference Result 115 states and 241 transitions. [2019-01-12 15:11:44,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 15:11:44,011 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 146 [2019-01-12 15:11:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:44,017 INFO L225 Difference]: With dead ends: 115 [2019-01-12 15:11:44,017 INFO L226 Difference]: Without dead ends: 76 [2019-01-12 15:11:44,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=324, Invalid=1082, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 15:11:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-12 15:11:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-01-12 15:11:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-12 15:11:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2019-01-12 15:11:44,041 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 146 [2019-01-12 15:11:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:44,042 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2019-01-12 15:11:44,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 15:11:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2019-01-12 15:11:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 15:11:44,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:44,047 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:44,047 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:44,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:44,047 INFO L82 PathProgramCache]: Analyzing trace with hash 548614988, now seen corresponding path program 6 times [2019-01-12 15:11:44,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:44,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:44,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:44,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:44,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 174 proven. 59 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-01-12 15:11:44,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:44,267 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:44,280 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:11:44,385 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-01-12 15:11:44,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:44,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-01-12 15:11:44,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:44,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2019-01-12 15:11:44,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:11:44,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:11:44,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:11:44,502 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand 9 states. [2019-01-12 15:11:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:44,780 INFO L93 Difference]: Finished difference Result 82 states and 116 transitions. [2019-01-12 15:11:44,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:11:44,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-01-12 15:11:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:44,791 INFO L225 Difference]: With dead ends: 82 [2019-01-12 15:11:44,791 INFO L226 Difference]: Without dead ends: 78 [2019-01-12 15:11:44,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:11:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-12 15:11:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-12 15:11:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-12 15:11:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2019-01-12 15:11:44,819 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 105 [2019-01-12 15:11:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:44,820 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2019-01-12 15:11:44,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:11:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2019-01-12 15:11:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-12 15:11:44,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:44,827 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:44,827 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:44,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:44,829 INFO L82 PathProgramCache]: Analyzing trace with hash 938070515, now seen corresponding path program 7 times [2019-01-12 15:11:44,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:44,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:44,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:44,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:44,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 137 proven. 567 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2019-01-12 15:11:45,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:45,129 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:45,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:45,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2019-01-12 15:11:45,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:45,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2019-01-12 15:11:45,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:11:45,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:11:45,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:11:45,358 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand 10 states. [2019-01-12 15:11:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:45,786 INFO L93 Difference]: Finished difference Result 87 states and 131 transitions. [2019-01-12 15:11:45,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:11:45,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2019-01-12 15:11:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:45,791 INFO L225 Difference]: With dead ends: 87 [2019-01-12 15:11:45,792 INFO L226 Difference]: Without dead ends: 83 [2019-01-12 15:11:45,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:11:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-12 15:11:45,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-12 15:11:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-12 15:11:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2019-01-12 15:11:45,824 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 214 [2019-01-12 15:11:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:45,826 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2019-01-12 15:11:45,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:11:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2019-01-12 15:11:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-01-12 15:11:45,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:45,834 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:45,835 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash 154593310, now seen corresponding path program 8 times [2019-01-12 15:11:45,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:45,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:45,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:45,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:45,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 995 proven. 433 refuted. 0 times theorem prover too weak. 4611 trivial. 0 not checked. [2019-01-12 15:11:46,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:46,235 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:46,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:11:46,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:11:46,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:46,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1001 proven. 422 refuted. 0 times theorem prover too weak. 4616 trivial. 0 not checked. [2019-01-12 15:11:46,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:46,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-01-12 15:11:46,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 15:11:46,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 15:11:46,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:11:46,504 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand 14 states. [2019-01-12 15:11:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:46,771 INFO L93 Difference]: Finished difference Result 103 states and 185 transitions. [2019-01-12 15:11:46,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:11:46,772 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 323 [2019-01-12 15:11:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:46,776 INFO L225 Difference]: With dead ends: 103 [2019-01-12 15:11:46,776 INFO L226 Difference]: Without dead ends: 86 [2019-01-12 15:11:46,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-12 15:11:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-12 15:11:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-12 15:11:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-12 15:11:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2019-01-12 15:11:46,791 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 323 [2019-01-12 15:11:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:46,792 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2019-01-12 15:11:46,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 15:11:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2019-01-12 15:11:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-01-12 15:11:46,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:46,796 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:46,797 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:46,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:46,797 INFO L82 PathProgramCache]: Analyzing trace with hash 960836894, now seen corresponding path program 9 times [2019-01-12 15:11:46,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:46,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:46,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:46,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 0 proven. 1500 refuted. 0 times theorem prover too weak. 3068 trivial. 0 not checked. [2019-01-12 15:11:47,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:47,686 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:47,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:11:47,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-12 15:11:47,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:47,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 0 proven. 1500 refuted. 0 times theorem prover too weak. 3068 trivial. 0 not checked. [2019-01-12 15:11:48,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:48,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 28 [2019-01-12 15:11:48,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 15:11:48,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 15:11:48,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:11:48,753 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand 28 states. [2019-01-12 15:11:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:49,418 INFO L93 Difference]: Finished difference Result 104 states and 148 transitions. [2019-01-12 15:11:49,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 15:11:49,419 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 282 [2019-01-12 15:11:49,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:49,423 INFO L225 Difference]: With dead ends: 104 [2019-01-12 15:11:49,423 INFO L226 Difference]: Without dead ends: 100 [2019-01-12 15:11:49,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 318 SyntacticMatches, 22 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:11:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-12 15:11:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2019-01-12 15:11:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-12 15:11:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2019-01-12 15:11:49,439 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 282 [2019-01-12 15:11:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:49,442 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2019-01-12 15:11:49,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 15:11:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2019-01-12 15:11:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-01-12 15:11:49,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:49,447 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 36, 22, 22, 22, 22, 22, 22, 22, 14, 9, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:49,447 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:49,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:49,449 INFO L82 PathProgramCache]: Analyzing trace with hash -175726449, now seen corresponding path program 10 times [2019-01-12 15:11:49,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:49,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:49,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 613 proven. 512 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2019-01-12 15:11:49,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:49,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:49,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:11:50,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:11:50,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:50,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 543 proven. 608 refuted. 0 times theorem prover too weak. 4363 trivial. 0 not checked. [2019-01-12 15:11:50,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:50,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-01-12 15:11:50,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 15:11:50,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 15:11:50,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-01-12 15:11:50,291 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand 17 states. [2019-01-12 15:11:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:51,252 INFO L93 Difference]: Finished difference Result 196 states and 316 transitions. [2019-01-12 15:11:51,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 15:11:51,254 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 309 [2019-01-12 15:11:51,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:51,257 INFO L225 Difference]: With dead ends: 196 [2019-01-12 15:11:51,257 INFO L226 Difference]: Without dead ends: 79 [2019-01-12 15:11:51,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:11:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-12 15:11:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-12 15:11:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-12 15:11:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2019-01-12 15:11:51,272 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 309 [2019-01-12 15:11:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:51,272 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2019-01-12 15:11:51,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 15:11:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2019-01-12 15:11:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-01-12 15:11:51,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:51,277 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 35, 21, 21, 21, 21, 21, 21, 21, 14, 8, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:51,277 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:51,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1451452999, now seen corresponding path program 11 times [2019-01-12 15:11:51,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:51,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:51,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:51,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:51,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 679 proven. 490 refuted. 0 times theorem prover too weak. 3878 trivial. 0 not checked. [2019-01-12 15:11:52,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:52,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:52,180 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:11:52,238 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-01-12 15:11:52,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:52,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 2931 proven. 118 refuted. 0 times theorem prover too weak. 1998 trivial. 0 not checked. [2019-01-12 15:11:52,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:52,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2019-01-12 15:11:52,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 15:11:52,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 15:11:52,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:11:52,413 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand 14 states. [2019-01-12 15:11:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:52,824 INFO L93 Difference]: Finished difference Result 156 states and 208 transitions. [2019-01-12 15:11:52,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 15:11:52,825 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 296 [2019-01-12 15:11:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:52,828 INFO L225 Difference]: With dead ends: 156 [2019-01-12 15:11:52,828 INFO L226 Difference]: Without dead ends: 81 [2019-01-12 15:11:52,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2019-01-12 15:11:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-12 15:11:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2019-01-12 15:11:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-12 15:11:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2019-01-12 15:11:52,840 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 296 [2019-01-12 15:11:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:52,842 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2019-01-12 15:11:52,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 15:11:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2019-01-12 15:11:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-01-12 15:11:52,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:52,847 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:52,848 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:52,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2073602180, now seen corresponding path program 12 times [2019-01-12 15:11:52,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:52,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:52,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 375 proven. 1253 refuted. 0 times theorem prover too weak. 4411 trivial. 0 not checked. [2019-01-12 15:11:53,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:53,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:53,254 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:11:53,415 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-01-12 15:11:53,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:53,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 486 proven. 1072 refuted. 0 times theorem prover too weak. 4481 trivial. 0 not checked. [2019-01-12 15:11:53,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:53,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2019-01-12 15:11:53,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 15:11:53,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 15:11:53,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:11:53,545 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand 15 states. [2019-01-12 15:11:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:53,768 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2019-01-12 15:11:53,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 15:11:53,769 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 323 [2019-01-12 15:11:53,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:53,771 INFO L225 Difference]: With dead ends: 91 [2019-01-12 15:11:53,771 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:11:53,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=303, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:11:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:11:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:11:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:11:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:11:53,774 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 323 [2019-01-12 15:11:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:53,775 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:11:53,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 15:11:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:11:53,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:11:53,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:11:55,878 WARN L181 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2019-01-12 15:11:56,073 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 1 [2019-01-12 15:11:56,218 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 8 [2019-01-12 15:11:56,251 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:11:56,251 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:11:56,251 INFO L444 ceAbstractionStarter]: At program point L29(lines 23 30) the Hoare annotation is: (<= 7 ULTIMATE.start_main_~x~0) [2019-01-12 15:11:56,252 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:11:56,252 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-12 15:11:56,252 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-01-12 15:11:56,252 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (and (<= 7 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 7)) [2019-01-12 15:11:56,252 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-01-12 15:11:56,252 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 28) no Hoare annotation was computed. [2019-01-12 15:11:56,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2019-01-12 15:11:56,253 INFO L448 ceAbstractionStarter]: For program point fiboEXIT(lines 5 13) no Hoare annotation was computed. [2019-01-12 15:11:56,253 INFO L448 ceAbstractionStarter]: For program point fiboFINAL(lines 5 13) no Hoare annotation was computed. [2019-01-12 15:11:56,253 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:56,253 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-01-12 15:11:56,253 INFO L444 ceAbstractionStarter]: At program point L11-2(line 11) the Hoare annotation is: (let ((.cse1 (<= 4 |fibo_#in~n|)) (.cse7 (<= |fibo_#in~n| fibo_~n)) (.cse3 (<= fibo_~n |fibo_#in~n|)) (.cse5 (<= |fibo_#t~ret0| 1)) (.cse6 (<= 1 |fibo_#t~ret0|)) (.cse4 (<= 3 fibo_~n))) (let ((.cse0 (and .cse3 .cse5 (<= |fibo_#in~n| 3) .cse6 .cse4)) (.cse2 (and .cse1 (<= |fibo_#in~n| 4) .cse3 .cse7 (<= 2 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 2)))) (and (or (< |fibo_#in~n| 3) .cse0 .cse1) (or (<= 8 |fibo_#in~n|) (and (<= |fibo_#t~ret0| 5) (<= |fibo_#in~n| 6) (<= 5 |fibo_#t~ret0|)) (<= fibo_~n 5) (and (<= 7 |fibo_#in~n|) (and (<= |fibo_#t~ret0| 8) (<= 8 |fibo_#t~ret0|)))) (or .cse2 (and .cse3 (<= 3 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 3) .cse4) .cse0 (and (<= |fibo_#in~n| 2) .cse3 .cse5 .cse6 (< 1 fibo_~n)) (and .cse3 (<= 6 |fibo_#in~n|))) (or (< |fibo_#in~n| 4) .cse2 (and (<= 5 |fibo_#in~n|) .cse7))))) [2019-01-12 15:11:56,254 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 12) no Hoare annotation was computed. [2019-01-12 15:11:56,254 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2019-01-12 15:11:56,254 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 12) no Hoare annotation was computed. [2019-01-12 15:11:56,254 INFO L451 ceAbstractionStarter]: At program point fiboENTRY(lines 5 13) the Hoare annotation is: true [2019-01-12 15:11:56,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:11:56 BoogieIcfgContainer [2019-01-12 15:11:56,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:11:56,273 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:11:56,273 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:11:56,274 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:11:56,275 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:36" (3/4) ... [2019-01-12 15:11:56,280 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:11:56,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo [2019-01-12 15:11:56,296 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:11:56,296 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:11:56,352 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:11:56,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:11:56,354 INFO L168 Benchmark]: Toolchain (without parser) took 20020.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.1 MB). Free memory was 946.0 MB in the beginning and 902.6 MB in the end (delta: 43.4 MB). Peak memory consumption was 434.6 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:56,355 INFO L168 Benchmark]: CDTParser took 0.64 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:56,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.22 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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:56,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.96 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:56,356 INFO L168 Benchmark]: Boogie Preprocessor took 14.73 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:56,356 INFO L168 Benchmark]: RCFGBuilder took 353.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:56,357 INFO L168 Benchmark]: TraceAbstraction took 19320.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 264.8 MB). Free memory was 1.1 GB in the beginning and 902.6 MB in the end (delta: 201.7 MB). Peak memory consumption was 466.4 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:56,357 INFO L168 Benchmark]: Witness Printer took 79.92 ms. Allocated memory is still 1.4 GB. Free memory is still 902.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:56,368 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.64 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 216.22 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 28.96 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.73 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 353.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19320.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 264.8 MB). Free memory was 1.1 GB in the beginning and 902.6 MB in the end (delta: 201.7 MB). Peak memory consumption was 466.4 MB. Max. memory is 11.5 GB. * Witness Printer took 79.92 ms. Allocated memory is still 1.4 GB. Free memory is still 902.6 MB. There was no memory consumed. 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: 7 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. SAFE Result, 19.1s OverallTime, 15 OverallIterations, 47 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 298 SDtfs, 407 SDslu, 1373 SDs, 0 SdLazy, 1993 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2527 GetRequests, 2269 SyntacticMatches, 26 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 26 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 179 PreInvPairs, 456 NumberOfFragments, 178 HoareAnnotationTreeSize, 179 FomulaSimplifications, 3552 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 5 FomulaSimplificationsInter, 2694 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 4459 NumberOfCodeBlocks, 4077 NumberOfCodeBlocksAsserted, 147 NumberOfCheckSat, 4431 ConstructedInterpolants, 0 QuantifiedInterpolants, 1995413 SizeOfPredicates, 69 NumberOfNonLiveVariables, 4069 ConjunctsInSsa, 306 ConjunctsInUnsatCore, 28 InterpolantComputations, 2 PerfectInterpolantSequences, 54104/64124 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...