./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/sum_20x0_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/sum_20x0_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 f4078ef7bc39da0337b6d8ed5ecbbcec336a37b8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:12:25,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:12:25,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:12:25,575 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:12:25,575 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:12:25,576 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:12:25,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:12:25,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:12:25,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:12:25,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:12:25,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:12:25,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:12:25,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:12:25,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:12:25,587 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:12:25,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:12:25,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:12:25,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:12:25,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:12:25,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:12:25,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:12:25,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:12:25,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:12:25,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:12:25,600 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:12:25,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:12:25,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:12:25,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:12:25,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:12:25,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:12:25,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:12:25,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:12:25,606 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:12:25,607 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:12:25,608 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:12:25,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:12:25,609 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:12:25,625 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:12:25,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:12:25,627 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:12:25,627 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:12:25,627 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:12:25,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:12:25,628 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:12:25,628 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:12:25,628 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:12:25,628 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:12:25,629 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:12:25,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:12:25,629 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:12:25,629 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:12:25,629 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:12:25,630 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:12:25,630 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:12:25,630 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:12:25,630 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:12:25,631 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:12:25,631 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:12:25,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:12:25,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:12:25,631 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:12:25,632 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:12:25,632 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:12:25,632 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:12:25,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:12:25,632 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 -> f4078ef7bc39da0337b6d8ed5ecbbcec336a37b8 [2019-01-12 15:12:25,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:12:25,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:12:25,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:12:25,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:12:25,703 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:12:25,705 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/sum_20x0_true-unreach-call_true-termination.c [2019-01-12 15:12:25,769 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0d44dbe/9a0c6a25015d4424a65e1fa0da29e20b/FLAG934339bdb [2019-01-12 15:12:26,235 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:12:26,236 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/sum_20x0_true-unreach-call_true-termination.c [2019-01-12 15:12:26,242 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0d44dbe/9a0c6a25015d4424a65e1fa0da29e20b/FLAG934339bdb [2019-01-12 15:12:26,570 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0d44dbe/9a0c6a25015d4424a65e1fa0da29e20b [2019-01-12 15:12:26,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:12:26,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:12:26,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:12:26,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:12:26,581 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:12:26,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:12:26" (1/1) ... [2019-01-12 15:12:26,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df7187c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:26, skipping insertion in model container [2019-01-12 15:12:26,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:12:26" (1/1) ... [2019-01-12 15:12:26,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:12:26,611 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:12:26,772 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:12:26,777 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:12:26,794 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:12:26,809 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:12:26,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:26 WrapperNode [2019-01-12 15:12:26,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:12:26,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:12:26,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:12:26,811 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:12:26,821 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:12:26" (1/1) ... [2019-01-12 15:12:26,827 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:12:26" (1/1) ... [2019-01-12 15:12:26,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:12:26,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:12:26,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:12:26,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:12:26,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:26" (1/1) ... [2019-01-12 15:12:26,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:26" (1/1) ... [2019-01-12 15:12:26,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:26" (1/1) ... [2019-01-12 15:12:26,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:26" (1/1) ... [2019-01-12 15:12:26,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:26" (1/1) ... [2019-01-12 15:12:26,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:26" (1/1) ... [2019-01-12 15:12:26,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:26" (1/1) ... [2019-01-12 15:12:26,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:12:26,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:12:26,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:12:26,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:12:26,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:26" (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:12:27,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:12:27,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:12:27,006 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-01-12 15:12:27,006 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-01-12 15:12:27,193 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:12:27,193 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:12:27,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:27 BoogieIcfgContainer [2019-01-12 15:12:27,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:12:27,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:12:27,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:12:27,202 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:12:27,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:12:26" (1/3) ... [2019-01-12 15:12:27,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e358e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:12:27, skipping insertion in model container [2019-01-12 15:12:27,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:26" (2/3) ... [2019-01-12 15:12:27,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e358e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:12:27, skipping insertion in model container [2019-01-12 15:12:27,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:27" (3/3) ... [2019-01-12 15:12:27,206 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_20x0_true-unreach-call_true-termination.c [2019-01-12 15:12:27,217 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:12:27,225 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:12:27,240 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:12:27,271 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:12:27,272 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:12:27,273 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:12:27,273 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:12:27,273 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:12:27,273 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:12:27,273 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:12:27,273 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:12:27,273 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:12:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 15:12:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:12:27,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:27,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:27,304 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:27,311 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-01-12 15:12:27,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:27,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:27,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:27,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:27,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:27,666 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:12:27,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:12:27,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:12:27,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:12:27,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:12:27,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:12:27,700 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-12 15:12:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:27,834 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-12 15:12:27,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:12:27,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:12:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:27,848 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:12:27,849 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 15:12:27,853 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:12:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 15:12:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 15:12:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 15:12:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 15:12:27,908 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-01-12 15:12:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:27,909 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 15:12:27,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:12:27,910 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 15:12:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 15:12:27,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:27,912 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:27,913 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:27,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:27,913 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-01-12 15:12:27,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:27,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:27,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:27,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:27,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:12:28,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:28,203 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:12:28,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:28,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:12:28,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:28,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 15:12:28,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:12:28,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:12:28,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:12:28,361 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-01-12 15:12:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:28,726 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-12 15:12:28,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:12:28,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-12 15:12:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:28,728 INFO L225 Difference]: With dead ends: 21 [2019-01-12 15:12:28,728 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 15:12:28,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:12:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 15:12:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 15:12:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 15:12:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 15:12:28,736 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-12 15:12:28,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:28,737 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 15:12:28,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:12:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 15:12:28,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 15:12:28,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:28,739 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:28,739 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:28,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:28,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-01-12 15:12:28,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:28,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:28,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:28,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:28,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:12:28,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:28,962 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:12:28,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:29,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:29,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:29,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:12:29,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:29,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 15:12:29,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:12:29,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:12:29,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:12:29,081 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-12 15:12:29,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:29,360 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-12 15:12:29,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:12:29,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 15:12:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:29,365 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:12:29,365 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 15:12:29,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:12:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 15:12:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 15:12:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 15:12:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 15:12:29,373 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-01-12 15:12:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:29,373 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 15:12:29,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:12:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 15:12:29,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 15:12:29,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:29,375 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:29,375 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:29,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:29,376 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-01-12 15:12:29,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:29,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:29,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:29,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:29,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:12:29,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:29,541 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:12:29,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:29,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 15:12:29,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:29,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:12:29,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:29,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-12 15:12:29,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:12:29,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:12:29,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:12:29,646 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2019-01-12 15:12:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:30,221 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 15:12:30,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:12:30,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-12 15:12:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:30,224 INFO L225 Difference]: With dead ends: 27 [2019-01-12 15:12:30,224 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 15:12:30,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:12:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 15:12:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 15:12:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 15:12:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 15:12:30,245 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-01-12 15:12:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:30,246 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 15:12:30,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:12:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 15:12:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 15:12:30,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:30,250 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:30,251 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:30,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-01-12 15:12:30,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:30,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:30,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:30,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:30,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:12:30,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:30,434 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:12:30,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:30,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:30,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:30,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:12:30,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:30,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 15:12:30,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:12:30,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:12:30,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:12:30,553 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-01-12 15:12:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:30,712 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-12 15:12:30,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:12:30,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 15:12:30,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:30,716 INFO L225 Difference]: With dead ends: 30 [2019-01-12 15:12:30,716 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 15:12:30,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:12:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 15:12:30,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 15:12:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:12:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 15:12:30,724 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-01-12 15:12:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:30,725 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 15:12:30,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:12:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 15:12:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:12:30,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:30,727 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:30,727 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:30,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-01-12 15:12:30,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:30,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:30,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:12:30,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:30,953 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:12:30,977 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:31,018 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 15:12:31,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:31,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:12:31,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:31,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-12 15:12:31,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:12:31,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:12:31,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:12:31,080 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 10 states. [2019-01-12 15:12:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:31,315 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 15:12:31,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:12:31,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-01-12 15:12:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:31,319 INFO L225 Difference]: With dead ends: 33 [2019-01-12 15:12:31,319 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 15:12:31,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:12:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 15:12:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 15:12:31,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 15:12:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 15:12:31,327 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-01-12 15:12:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:31,327 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 15:12:31,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:12:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 15:12:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 15:12:31,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:31,330 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:31,330 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:31,331 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-01-12 15:12:31,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:31,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:31,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:31,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:31,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:12:31,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:31,655 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:12:31,668 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:31,704 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 15:12:31,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:31,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:12:31,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:31,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-12 15:12:31,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:12:31,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:12:31,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:12:31,774 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2019-01-12 15:12:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:32,019 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-12 15:12:32,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:12:32,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-01-12 15:12:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:32,023 INFO L225 Difference]: With dead ends: 36 [2019-01-12 15:12:32,023 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:12:32,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:12:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:12:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 15:12:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 15:12:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 15:12:32,031 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-01-12 15:12:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:32,033 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 15:12:32,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:12:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 15:12:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 15:12:32,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:32,035 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:32,036 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:32,036 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-01-12 15:12:32,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:32,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:32,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:32,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:32,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:12:32,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:32,219 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:12:32,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:32,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:12:32,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:32,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-12 15:12:32,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:12:32,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:12:32,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:12:32,314 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 12 states. [2019-01-12 15:12:32,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:32,701 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 15:12:32,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 15:12:32,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-01-12 15:12:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:32,704 INFO L225 Difference]: With dead ends: 39 [2019-01-12 15:12:32,704 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:12:32,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:12:32,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:12:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 15:12:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 15:12:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 15:12:32,712 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-01-12 15:12:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:32,713 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 15:12:32,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:12:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 15:12:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 15:12:32,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:32,715 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:32,715 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:32,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:32,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-01-12 15:12:32,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:32,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:32,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:32,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:32,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:12:33,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:33,416 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:12:33,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:33,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:33,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:33,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:12:33,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:33,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 15:12:33,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 15:12:33,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 15:12:33,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:12:33,554 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-01-12 15:12:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:33,897 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-12 15:12:33,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 15:12:33,899 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-01-12 15:12:33,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:33,900 INFO L225 Difference]: With dead ends: 42 [2019-01-12 15:12:33,901 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 15:12:33,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:12:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 15:12:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 15:12:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 15:12:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 15:12:33,909 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-01-12 15:12:33,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:33,909 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 15:12:33,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 15:12:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 15:12:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:12:33,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:33,911 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:33,911 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:33,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-01-12 15:12:33,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:33,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:33,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:33,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:33,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:12:34,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:34,203 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:12:34,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:34,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 15:12:34,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:34,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:12:34,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:34,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-12 15:12:34,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 15:12:34,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 15:12:34,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:12:34,369 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2019-01-12 15:12:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:34,613 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-12 15:12:34,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 15:12:34,615 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-01-12 15:12:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:34,618 INFO L225 Difference]: With dead ends: 45 [2019-01-12 15:12:34,619 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 15:12:34,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:12:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 15:12:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 15:12:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 15:12:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-12 15:12:34,630 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-01-12 15:12:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:34,631 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-12 15:12:34,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 15:12:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-12 15:12:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 15:12:34,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:34,632 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:34,633 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:34,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-01-12 15:12:34,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:34,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:34,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 15:12:34,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:34,967 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:12:34,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:35,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:35,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:35,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 15:12:35,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:35,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-12 15:12:35,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 15:12:35,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 15:12:35,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:12:35,112 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2019-01-12 15:12:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:35,413 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-12 15:12:35,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 15:12:35,414 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-01-12 15:12:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:35,417 INFO L225 Difference]: With dead ends: 48 [2019-01-12 15:12:35,417 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 15:12:35,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:12:35,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 15:12:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 15:12:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 15:12:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-12 15:12:35,426 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-01-12 15:12:35,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:35,426 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-12 15:12:35,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 15:12:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-12 15:12:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 15:12:35,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:35,429 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:35,430 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:35,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:35,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-01-12 15:12:35,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:35,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:35,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:35,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 15:12:35,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:35,711 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:12:35,725 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:35,766 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-12 15:12:35,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:35,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 15:12:35,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:35,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 15:12:35,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 15:12:35,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 15:12:35,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:12:35,863 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2019-01-12 15:12:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:36,288 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-12 15:12:36,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 15:12:36,290 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-01-12 15:12:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:36,292 INFO L225 Difference]: With dead ends: 51 [2019-01-12 15:12:36,292 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 15:12:36,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:12:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 15:12:36,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 15:12:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 15:12:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-12 15:12:36,301 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-01-12 15:12:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:36,301 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-12 15:12:36,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 15:12:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-12 15:12:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 15:12:36,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:36,306 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:36,306 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:36,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:36,306 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-01-12 15:12:36,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:36,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:36,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:36,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:36,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 15:12:36,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:36,637 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:12:36,649 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:36,720 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-12 15:12:36,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:36,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 15:12:36,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:36,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 15:12:36,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 15:12:36,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 15:12:36,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2019-01-12 15:12:36,809 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 17 states. [2019-01-12 15:12:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:37,136 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-12 15:12:37,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 15:12:37,137 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-01-12 15:12:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:37,139 INFO L225 Difference]: With dead ends: 54 [2019-01-12 15:12:37,141 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 15:12:37,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2019-01-12 15:12:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 15:12:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-12 15:12:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 15:12:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-12 15:12:37,157 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-01-12 15:12:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:37,158 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-12 15:12:37,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 15:12:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-12 15:12:37,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 15:12:37,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:37,165 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:37,165 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:37,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:37,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-01-12 15:12:37,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:37,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:37,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:37,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:37,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 15:12:37,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:37,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 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:12:37,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:37,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 15:12:37,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:37,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-12 15:12:37,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 15:12:37,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 15:12:37,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:12:37,796 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 18 states. [2019-01-12 15:12:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:38,127 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-01-12 15:12:38,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 15:12:38,129 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-01-12 15:12:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:38,131 INFO L225 Difference]: With dead ends: 57 [2019-01-12 15:12:38,131 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 15:12:38,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2019-01-12 15:12:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 15:12:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 15:12:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 15:12:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-12 15:12:38,138 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-01-12 15:12:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:38,138 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-12 15:12:38,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 15:12:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-12 15:12:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 15:12:38,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:38,140 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:38,140 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:38,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:38,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-01-12 15:12:38,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:38,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:38,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:38,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 15:12:39,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:39,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:39,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:39,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:39,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:39,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 15:12:39,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:39,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-12 15:12:39,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 15:12:39,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 15:12:39,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2019-01-12 15:12:39,371 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 19 states. [2019-01-12 15:12:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:39,705 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-01-12 15:12:39,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 15:12:39,706 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2019-01-12 15:12:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:39,708 INFO L225 Difference]: With dead ends: 60 [2019-01-12 15:12:39,708 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 15:12:39,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 15:12:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 15:12:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-12 15:12:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 15:12:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-12 15:12:39,719 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-01-12 15:12:39,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:39,719 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-12 15:12:39,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 15:12:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-12 15:12:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:12:39,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:39,722 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:39,723 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:39,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:39,724 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-01-12 15:12:39,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:39,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:39,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:39,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:39,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 15:12:39,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:39,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:40,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:40,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-12 15:12:40,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:40,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 15:12:40,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:40,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-12 15:12:40,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 15:12:40,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 15:12:40,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:12:40,240 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 20 states. [2019-01-12 15:12:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:40,691 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-12 15:12:40,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 15:12:40,692 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2019-01-12 15:12:40,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:40,694 INFO L225 Difference]: With dead ends: 63 [2019-01-12 15:12:40,694 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 15:12:40,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 15:12:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 15:12:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-12 15:12:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 15:12:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-12 15:12:40,702 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-01-12 15:12:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:40,703 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-12 15:12:40,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 15:12:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-12 15:12:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 15:12:40,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:40,704 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:40,704 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:40,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:40,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-01-12 15:12:40,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:40,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:40,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:40,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:40,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 15:12:40,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:40,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:40,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:41,018 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:41,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:41,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 15:12:41,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:41,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-01-12 15:12:41,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 15:12:41,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 15:12:41,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:12:41,097 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 21 states. [2019-01-12 15:12:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:41,534 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-01-12 15:12:41,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 15:12:41,535 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-01-12 15:12:41,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:41,537 INFO L225 Difference]: With dead ends: 66 [2019-01-12 15:12:41,537 INFO L226 Difference]: Without dead ends: 62 [2019-01-12 15:12:41,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 15:12:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-12 15:12:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-12 15:12:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-12 15:12:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-01-12 15:12:41,545 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-01-12 15:12:41,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:41,548 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-01-12 15:12:41,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 15:12:41,548 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-01-12 15:12:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 15:12:41,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:41,549 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:41,550 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:41,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:41,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-01-12 15:12:41,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:41,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:41,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:41,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:41,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 15:12:41,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:41,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:41,992 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:42,066 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-12 15:12:42,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:42,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 15:12:42,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:42,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-12 15:12:42,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 15:12:42,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 15:12:42,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:12:42,133 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 22 states. [2019-01-12 15:12:42,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:42,465 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-01-12 15:12:42,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 15:12:42,466 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2019-01-12 15:12:42,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:42,468 INFO L225 Difference]: With dead ends: 69 [2019-01-12 15:12:42,469 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 15:12:42,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 15:12:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 15:12:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-12 15:12:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-12 15:12:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-12 15:12:42,477 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-01-12 15:12:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:42,477 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-12 15:12:42,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 15:12:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-12 15:12:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:12:42,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:42,481 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:42,481 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:42,481 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-01-12 15:12:42,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:42,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:42,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:42,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:42,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 15:12:42,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:42,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:42,832 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:42,891 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-12 15:12:42,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:42,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 15:12:42,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:42,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-12 15:12:42,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 15:12:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 15:12:42,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2019-01-12 15:12:42,988 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 23 states. [2019-01-12 15:12:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:43,782 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-01-12 15:12:43,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 15:12:43,784 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 117 [2019-01-12 15:12:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:43,786 INFO L225 Difference]: With dead ends: 72 [2019-01-12 15:12:43,786 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 15:12:43,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 15:12:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 15:12:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 15:12:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 15:12:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-12 15:12:43,792 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-01-12 15:12:43,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:43,793 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-12 15:12:43,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 15:12:43,793 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-12 15:12:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 15:12:43,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:43,797 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:43,798 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:43,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-01-12 15:12:43,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:43,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:43,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:43,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:43,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 15:12:44,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:44,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:44,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:44,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 15:12:44,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:44,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-12 15:12:44,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 15:12:44,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 15:12:44,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:12:44,404 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 24 states. [2019-01-12 15:12:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:45,262 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-12 15:12:45,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 15:12:45,263 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 123 [2019-01-12 15:12:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:45,265 INFO L225 Difference]: With dead ends: 75 [2019-01-12 15:12:45,266 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 15:12:45,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 15:12:45,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 15:12:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 15:12:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 15:12:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-12 15:12:45,272 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-01-12 15:12:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:45,272 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-12 15:12:45,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 15:12:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-12 15:12:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 15:12:45,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:45,274 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:45,274 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:45,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-01-12 15:12:45,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:45,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:45,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 649 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2019-01-12 15:12:48,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:48,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:48,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:48,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:48,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:48,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 39 proven. 610 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2019-01-12 15:12:48,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:48,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 53 [2019-01-12 15:12:48,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-12 15:12:48,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-12 15:12:48,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=2645, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 15:12:48,686 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 53 states. [2019-01-12 15:12:49,778 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-01-12 15:12:50,466 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-01-12 15:12:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:53,808 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-01-12 15:12:53,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-12 15:12:53,809 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 129 [2019-01-12 15:12:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:53,813 INFO L225 Difference]: With dead ends: 78 [2019-01-12 15:12:53,813 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 15:12:53,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 124 SyntacticMatches, 21 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=484, Invalid=8446, Unknown=0, NotChecked=0, Total=8930 [2019-01-12 15:12:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 15:12:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-12 15:12:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 15:12:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-01-12 15:12:53,824 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2019-01-12 15:12:53,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:53,824 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-01-12 15:12:53,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-12 15:12:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-01-12 15:12:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-12 15:12:53,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:53,828 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:53,828 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:53,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:53,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1463802477, now seen corresponding path program 21 times [2019-01-12 15:12:53,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:53,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:53,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:53,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:53,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 672 proven. 41 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2019-01-12 15:12:54,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:54,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:54,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:55,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-12 15:12:55,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:55,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 672 proven. 41 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2019-01-12 15:12:55,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:55,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-01-12 15:12:55,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 15:12:55,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 15:12:55,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2019-01-12 15:12:55,143 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 25 states. [2019-01-12 15:12:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:55,974 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-01-12 15:12:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 15:12:55,977 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 135 [2019-01-12 15:12:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:55,978 INFO L225 Difference]: With dead ends: 74 [2019-01-12 15:12:55,978 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:12:55,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 15:12:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:12:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:12:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:12:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:12:55,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2019-01-12 15:12:55,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:55,984 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:12:55,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 15:12:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:12:55,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:12:55,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:12:56,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:12:56,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:12:56,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:12:56,061 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-01-12 15:12:56,061 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2019-01-12 15:12:56,061 INFO L444 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (and (<= ULTIMATE.start_main_~a~0 20) (<= 20 ULTIMATE.start_main_~a~0)) [2019-01-12 15:12:56,062 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-12 15:12:56,062 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 18) no Hoare annotation was computed. [2019-01-12 15:12:56,062 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2019-01-12 15:12:56,062 INFO L448 ceAbstractionStarter]: For program point sumEXIT(lines 3 9) no Hoare annotation was computed. [2019-01-12 15:12:56,062 INFO L444 ceAbstractionStarter]: At program point L7(line 7) the Hoare annotation is: (and (<= |sum_#in~m| sum_~m) (<= sum_~m |sum_#in~m|) (<= sum_~n |sum_#in~n|) (< 0 sum_~n) (<= |sum_#in~n| sum_~n)) [2019-01-12 15:12:56,062 INFO L448 ceAbstractionStarter]: For program point L7-1(line 7) no Hoare annotation was computed. [2019-01-12 15:12:56,063 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 8) no Hoare annotation was computed. [2019-01-12 15:12:56,063 INFO L448 ceAbstractionStarter]: For program point sumFINAL(lines 3 9) no Hoare annotation was computed. [2019-01-12 15:12:56,063 INFO L451 ceAbstractionStarter]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2019-01-12 15:12:56,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:12:56 BoogieIcfgContainer [2019-01-12 15:12:56,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:12:56,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:12:56,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:12:56,073 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:12:56,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:27" (3/4) ... [2019-01-12 15:12:56,083 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:12:56,094 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2019-01-12 15:12:56,101 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:12:56,102 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 15:12:56,156 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:12:56,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:12:56,157 INFO L168 Benchmark]: Toolchain (without parser) took 29582.40 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 410.5 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -328.2 MB). Peak memory consumption was 82.4 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:56,159 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:56,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.34 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 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:12:56,160 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.31 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:56,161 INFO L168 Benchmark]: Boogie Preprocessor took 19.90 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:56,161 INFO L168 Benchmark]: RCFGBuilder took 321.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:56,162 INFO L168 Benchmark]: TraceAbstraction took 28874.37 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 306.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -194.7 MB). Peak memory consumption was 112.0 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:56,162 INFO L168 Benchmark]: Witness Printer took 83.31 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:56,173 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 233.34 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.31 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.90 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 321.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28874.37 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 306.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -194.7 MB). Peak memory consumption was 112.0 MB. Max. memory is 11.5 GB. * Witness Printer took 83.31 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. SAFE Result, 28.8s OverallTime, 22 OverallIterations, 22 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 235 SDtfs, 577 SDslu, 2205 SDs, 0 SdLazy, 3811 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2441 GetRequests, 1823 SyntacticMatches, 21 SemanticMatches, 597 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2432 ImplicationChecksByTransitivity, 17.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 24 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 3159 NumberOfCodeBlocks, 3159 NumberOfCodeBlocksAsserted, 167 NumberOfCheckSat, 3116 ConstructedInterpolants, 0 QuantifiedInterpolants, 920248 SizeOfPredicates, 276 NumberOfNonLiveVariables, 4746 ConjunctsInSsa, 677 ConjunctsInUnsatCore, 43 InterpolantComputations, 1 PerfectInterpolantSequences, 11387/20328 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...