./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/sum_25x0_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_25x0_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 4039dcb878ce4fadab8efdd435e8ec3d803b5cc8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:33,518 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:12:33,520 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:12:33,537 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:12:33,538 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:12:33,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:12:33,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:12:33,546 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:12:33,548 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:12:33,551 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:12:33,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:12:33,554 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:12:33,555 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:12:33,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:12:33,565 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:12:33,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:12:33,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:12:33,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:12:33,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:12:33,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:12:33,573 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:12:33,574 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:12:33,577 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:12:33,578 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:12:33,578 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:12:33,579 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:12:33,581 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:12:33,582 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:12:33,583 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:12:33,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:12:33,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:12:33,588 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:12:33,588 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:12:33,588 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:12:33,590 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:12:33,591 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:12:33,591 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:33,626 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:12:33,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:12:33,628 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:12:33,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:12:33,628 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:12:33,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:12:33,629 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:12:33,629 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:12:33,629 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:12:33,629 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:12:33,629 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:12:33,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:12:33,630 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:12:33,633 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:12:33,633 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:12:33,633 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:12:33,634 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:12:33,634 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:12:33,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:12:33,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:12:33,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:12:33,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:12:33,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:12:33,637 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:12:33,637 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:12:33,637 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:12:33,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:12:33,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:12:33,638 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 -> 4039dcb878ce4fadab8efdd435e8ec3d803b5cc8 [2019-01-12 15:12:33,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:12:33,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:12:33,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:12:33,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:12:33,731 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:12:33,731 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/sum_25x0_true-unreach-call_true-termination.c [2019-01-12 15:12:33,786 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb512516/cdb9ad69cd0143d682c9214d8e2a6345/FLAG12b56ff6a [2019-01-12 15:12:34,167 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:12:34,168 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/sum_25x0_true-unreach-call_true-termination.c [2019-01-12 15:12:34,173 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb512516/cdb9ad69cd0143d682c9214d8e2a6345/FLAG12b56ff6a [2019-01-12 15:12:34,554 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb512516/cdb9ad69cd0143d682c9214d8e2a6345 [2019-01-12 15:12:34,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:12:34,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:12:34,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:12:34,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:12:34,564 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:12:34,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:12:34" (1/1) ... [2019-01-12 15:12:34,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4667f227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:34, skipping insertion in model container [2019-01-12 15:12:34,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:12:34" (1/1) ... [2019-01-12 15:12:34,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:12:34,593 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:12:34,774 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:12:34,778 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:12:34,795 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:12:34,810 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:12:34,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:34 WrapperNode [2019-01-12 15:12:34,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:12:34,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:12:34,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:12:34,812 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:12:34,822 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:34" (1/1) ... [2019-01-12 15:12:34,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:34" (1/1) ... [2019-01-12 15:12:34,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:12:34,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:12:34,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:12:34,852 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:12:34,863 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:34" (1/1) ... [2019-01-12 15:12:34,863 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:34" (1/1) ... [2019-01-12 15:12:34,866 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:34" (1/1) ... [2019-01-12 15:12:34,867 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:34" (1/1) ... [2019-01-12 15:12:34,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:34" (1/1) ... [2019-01-12 15:12:34,872 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:34" (1/1) ... [2019-01-12 15:12:34,873 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:34" (1/1) ... [2019-01-12 15:12:34,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:12:34,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:12:34,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:12:34,877 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:12:34,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:34" (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:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:12:35,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:12:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-01-12 15:12:35,017 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-01-12 15:12:35,252 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:12:35,252 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:12:35,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:35 BoogieIcfgContainer [2019-01-12 15:12:35,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:12:35,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:12:35,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:12:35,257 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:12:35,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:12:34" (1/3) ... [2019-01-12 15:12:35,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fce13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:12:35, skipping insertion in model container [2019-01-12 15:12:35,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:34" (2/3) ... [2019-01-12 15:12:35,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fce13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:12:35, skipping insertion in model container [2019-01-12 15:12:35,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:35" (3/3) ... [2019-01-12 15:12:35,261 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_25x0_true-unreach-call_true-termination.c [2019-01-12 15:12:35,270 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:12:35,276 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:12:35,288 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:12:35,318 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:12:35,319 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:12:35,319 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:12:35,319 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:12:35,319 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:12:35,319 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:12:35,319 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:12:35,320 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:12:35,320 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:12:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 15:12:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:12:35,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:35,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:35,348 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-01-12 15:12:35,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:35,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:35,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:35,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:35,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:35,687 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:35,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:12:35,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:12:35,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:12:35,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:12:35,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:12:35,716 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-12 15:12:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:35,878 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-12 15:12:35,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:12:35,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:12:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:35,890 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:12:35,890 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 15:12:35,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:12:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 15:12:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 15:12:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 15:12:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 15:12:35,932 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-01-12 15:12:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:35,933 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 15:12:35,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:12:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 15:12:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 15:12:35,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:35,936 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:35,936 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:35,936 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-01-12 15:12:35,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:35,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:35,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:35,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:35,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:36,076 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:36,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:36,076 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:36,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:36,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:36,184 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:36,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:36,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 15:12:36,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:12:36,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:12:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:12:36,219 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-01-12 15:12:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:36,521 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-12 15:12:36,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:12:36,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-12 15:12:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:36,523 INFO L225 Difference]: With dead ends: 21 [2019-01-12 15:12:36,523 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 15:12:36,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:12:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 15:12:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 15:12:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 15:12:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 15:12:36,530 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-12 15:12:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:36,530 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 15:12:36,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:12:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 15:12:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 15:12:36,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:36,532 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:36,532 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:36,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-01-12 15:12:36,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:36,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:36,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:36,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:36,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:36,730 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:36,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:36,731 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:36,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:36,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:36,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:36,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:36,804 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:36,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:36,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 15:12:36,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:12:36,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:12:36,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:12:36,829 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-12 15:12:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:37,041 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-12 15:12:37,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:12:37,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 15:12:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:37,046 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:12:37,046 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 15:12:37,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:12:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 15:12:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 15:12:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 15:12:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 15:12:37,054 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-01-12 15:12:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:37,055 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 15:12:37,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:12:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 15:12:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 15:12:37,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:37,056 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:37,058 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:37,058 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-01-12 15:12:37,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:37,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:37,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:37,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:37,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:37,219 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:37,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:37,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 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:37,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:37,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 15:12:37,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:37,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:37,287 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:37,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:37,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-12 15:12:37,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:12:37,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:12:37,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:12:37,314 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2019-01-12 15:12:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:37,740 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 15:12:37,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:12:37,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-12 15:12:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:37,743 INFO L225 Difference]: With dead ends: 27 [2019-01-12 15:12:37,743 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 15:12:37,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:12:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 15:12:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 15:12:37,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 15:12:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 15:12:37,751 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-01-12 15:12:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:37,752 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 15:12:37,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:12:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 15:12:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 15:12:37,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:37,755 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:37,755 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:37,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:37,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-01-12 15:12:37,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:37,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:37,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:37,908 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:37,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:37,909 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:37,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:37,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:37,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:37,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:37,987 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:38,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:38,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 15:12:38,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:12:38,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:12:38,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:12:38,009 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-01-12 15:12:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:38,157 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-12 15:12:38,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:12:38,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 15:12:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:38,159 INFO L225 Difference]: With dead ends: 30 [2019-01-12 15:12:38,159 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 15:12:38,161 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:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 15:12:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 15:12:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:12:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 15:12:38,167 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-01-12 15:12:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:38,167 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 15:12:38,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:12:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 15:12:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:12:38,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:38,170 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:38,171 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:38,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:38,172 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-01-12 15:12:38,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:38,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:38,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:38,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:38,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:38,385 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:38,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:38,386 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:38,408 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:38,517 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 15:12:38,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:38,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:38,574 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:38,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:38,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-12 15:12:38,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:12:38,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:12:38,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:12:38,595 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 10 states. [2019-01-12 15:12:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:38,808 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 15:12:38,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:12:38,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-01-12 15:12:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:38,810 INFO L225 Difference]: With dead ends: 33 [2019-01-12 15:12:38,811 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 15:12:38,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:12:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 15:12:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 15:12:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 15:12:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 15:12:38,820 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-01-12 15:12:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:38,821 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 15:12:38,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:12:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 15:12:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 15:12:38,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:38,824 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:38,825 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:38,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:38,825 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-01-12 15:12:38,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:38,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:38,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:38,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:38,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:39,010 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:39,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:39,011 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:39,022 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:39,060 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 15:12:39,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:39,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:39,092 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:39,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:39,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-12 15:12:39,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:12:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:12:39,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:12:39,113 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2019-01-12 15:12:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:39,336 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-12 15:12:39,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:12:39,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-01-12 15:12:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:39,340 INFO L225 Difference]: With dead ends: 36 [2019-01-12 15:12:39,340 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:12:39,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:12:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:12:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 15:12:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 15:12:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 15:12:39,347 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-01-12 15:12:39,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:39,348 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 15:12:39,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:12:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 15:12:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 15:12:39,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:39,350 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:39,350 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:39,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:39,351 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-01-12 15:12:39,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:39,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:39,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:39,561 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:39,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:39,562 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:39,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:39,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:39,624 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:39,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:39,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-12 15:12:39,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:12:39,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:12:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:12:39,646 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 12 states. [2019-01-12 15:12:39,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:39,998 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 15:12:39,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 15:12:39,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-01-12 15:12:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:40,002 INFO L225 Difference]: With dead ends: 39 [2019-01-12 15:12:40,002 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:12:40,003 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:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:12:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 15:12:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 15:12:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 15:12:40,009 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-01-12 15:12:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:40,009 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 15:12:40,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:12:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 15:12:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 15:12:40,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:40,011 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:40,012 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:40,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:40,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-01-12 15:12:40,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:40,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:40,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:40,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:40,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:40,701 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:40,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:40,701 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:40,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:40,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:40,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:40,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:40,796 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:40,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:40,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 15:12:40,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 15:12:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 15:12:40,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:12:40,820 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-01-12 15:12:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:41,038 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-12 15:12:41,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 15:12:41,039 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-01-12 15:12:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:41,041 INFO L225 Difference]: With dead ends: 42 [2019-01-12 15:12:41,042 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 15:12:41,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:12:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 15:12:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 15:12:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 15:12:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 15:12:41,048 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-01-12 15:12:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:41,049 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 15:12:41,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 15:12:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 15:12:41,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:12:41,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:41,050 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:41,051 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:41,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:41,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-01-12 15:12:41,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:41,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:41,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:41,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:41,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:41,302 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:41,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:41,303 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:41,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:41,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 15:12:41,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:41,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:41,449 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:41,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:41,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-12 15:12:41,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 15:12:41,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 15:12:41,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:12:41,474 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2019-01-12 15:12:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:41,701 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-12 15:12:41,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 15:12:41,702 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-01-12 15:12:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:41,705 INFO L225 Difference]: With dead ends: 45 [2019-01-12 15:12:41,705 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 15:12:41,707 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:41,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 15:12:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 15:12:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 15:12:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-12 15:12:41,713 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-01-12 15:12:41,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:41,713 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-12 15:12:41,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 15:12:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-12 15:12:41,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 15:12:41,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:41,715 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:41,715 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-01-12 15:12:41,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:41,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:41,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:41,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:42,054 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:42,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:42,054 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:42,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:42,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:42,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:42,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:42,164 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:42,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:42,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-12 15:12:42,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 15:12:42,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 15:12:42,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:12:42,187 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2019-01-12 15:12:42,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:42,466 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-12 15:12:42,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 15:12:42,467 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-01-12 15:12:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:42,470 INFO L225 Difference]: With dead ends: 48 [2019-01-12 15:12:42,470 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 15:12:42,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:12:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 15:12:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 15:12:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 15:12:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-12 15:12:42,478 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-01-12 15:12:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:42,478 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-12 15:12:42,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 15:12:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-12 15:12:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 15:12:42,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:42,480 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:42,480 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:42,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:42,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-01-12 15:12:42,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:42,481 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,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:42,672 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:42,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:42,673 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:42,684 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:42,744 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-12 15:12:42,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:42,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:42,782 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:42,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:42,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 15:12:42,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 15:12:42,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 15:12:42,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:12:42,818 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2019-01-12 15:12:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:43,252 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-12 15:12:43,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 15:12:43,255 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-01-12 15:12:43,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:43,257 INFO L225 Difference]: With dead ends: 51 [2019-01-12 15:12:43,257 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 15:12:43,259 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:43,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 15:12:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 15:12:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 15:12:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-12 15:12:43,267 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-01-12 15:12:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:43,268 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-12 15:12:43,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 15:12:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-12 15:12:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 15:12:43,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:43,269 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:43,272 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:43,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:43,273 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-01-12 15:12:43,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:43,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:43,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:43,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:43,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:43,659 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:43,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:43,660 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:43,671 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:43,717 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-12 15:12:43,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:43,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:43,761 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:43,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:43,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 15:12:43,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 15:12:43,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 15:12:43,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2019-01-12 15:12:43,783 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 17 states. [2019-01-12 15:12:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:44,138 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-12 15:12:44,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 15:12:44,139 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-01-12 15:12:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:44,141 INFO L225 Difference]: With dead ends: 54 [2019-01-12 15:12:44,141 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 15:12:44,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:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 15:12:44,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-12 15:12:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 15:12:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-12 15:12:44,151 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-01-12 15:12:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:44,151 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-12 15:12:44,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 15:12:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-12 15:12:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 15:12:44,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:44,154 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:44,155 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:44,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:44,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-01-12 15:12:44,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:44,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:44,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:44,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:44,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:44,672 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:44,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:44,672 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:44,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:44,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:44,759 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:44,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:44,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-12 15:12:44,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 15:12:44,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 15:12:44,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:12:44,782 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 18 states. [2019-01-12 15:12:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:45,124 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-01-12 15:12:45,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 15:12:45,126 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-01-12 15:12:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:45,128 INFO L225 Difference]: With dead ends: 57 [2019-01-12 15:12:45,128 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 15:12:45,129 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:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 15:12:45,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 15:12:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 15:12:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-12 15:12:45,136 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-01-12 15:12:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:45,137 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-12 15:12:45,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 15:12:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-12 15:12:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 15:12:45,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:45,138 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:45,138 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:45,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-01-12 15:12:45,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:45,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:45,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:45,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:45,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:45,379 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:45,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:45,379 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:45,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:45,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:45,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:45,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:45,476 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:45,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:45,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-12 15:12:45,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 15:12:45,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 15:12:45,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2019-01-12 15:12:45,509 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 19 states. [2019-01-12 15:12:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:45,849 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-01-12 15:12:45,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 15:12:45,850 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2019-01-12 15:12:45,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:45,852 INFO L225 Difference]: With dead ends: 60 [2019-01-12 15:12:45,852 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 15:12:45,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 15:12:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 15:12:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-12 15:12:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 15:12:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-12 15:12:45,861 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-01-12 15:12:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:45,864 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-12 15:12:45,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 15:12:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-12 15:12:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:12:45,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:45,865 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:45,866 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:45,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:45,866 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-01-12 15:12:45,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:45,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:45,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:46,106 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:46,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:46,106 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:46,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:46,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-12 15:12:46,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:46,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:46,249 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:46,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:46,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-12 15:12:46,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 15:12:46,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 15:12:46,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:12:46,272 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 20 states. [2019-01-12 15:12:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:46,696 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-12 15:12:46,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 15:12:46,697 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2019-01-12 15:12:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:46,699 INFO L225 Difference]: With dead ends: 63 [2019-01-12 15:12:46,699 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 15:12:46,701 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:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 15:12:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-12 15:12:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 15:12:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-12 15:12:46,707 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-01-12 15:12:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:46,708 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-12 15:12:46,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 15:12:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-12 15:12:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 15:12:46,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:46,711 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:46,711 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:46,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:46,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-01-12 15:12:46,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:46,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:46,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:46,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:46,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:47,619 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:47,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:47,620 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:47,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:47,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:47,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:47,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:47,741 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:47,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:47,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-01-12 15:12:47,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 15:12:47,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 15:12:47,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:12:47,777 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 21 states. [2019-01-12 15:12:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:48,165 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-01-12 15:12:48,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 15:12:48,167 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-01-12 15:12:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:48,169 INFO L225 Difference]: With dead ends: 66 [2019-01-12 15:12:48,169 INFO L226 Difference]: Without dead ends: 62 [2019-01-12 15:12:48,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 15:12:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-12 15:12:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-12 15:12:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-12 15:12:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-01-12 15:12:48,177 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-01-12 15:12:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:48,178 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-01-12 15:12:48,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 15:12:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-01-12 15:12:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 15:12:48,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:48,181 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:48,181 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:48,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:48,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-01-12 15:12:48,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:48,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:48,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:48,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:48,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:48,543 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:48,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:48,543 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:48,554 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:48,629 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-12 15:12:48,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:48,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:48,678 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:48,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:48,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-12 15:12:48,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 15:12:48,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 15:12:48,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:12:48,700 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 22 states. [2019-01-12 15:12:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:49,035 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-01-12 15:12:49,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 15:12:49,037 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2019-01-12 15:12:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:49,038 INFO L225 Difference]: With dead ends: 69 [2019-01-12 15:12:49,038 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 15:12:49,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 15:12:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 15:12:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-12 15:12:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-12 15:12:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-12 15:12:49,047 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-01-12 15:12:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:49,049 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-12 15:12:49,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 15:12:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-12 15:12:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:12:49,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:49,051 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:49,052 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:49,053 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-01-12 15:12:49,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:49,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:49,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:49,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:49,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:49,422 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:49,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:49,422 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:49,433 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:49,486 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-12 15:12:49,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:49,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:49,522 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:49,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:49,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-12 15:12:49,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 15:12:49,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 15:12:49,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2019-01-12 15:12:49,546 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 23 states. [2019-01-12 15:12:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:50,262 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-01-12 15:12:50,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 15:12:50,263 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 117 [2019-01-12 15:12:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:50,265 INFO L225 Difference]: With dead ends: 72 [2019-01-12 15:12:50,265 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 15:12:50,266 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:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 15:12:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 15:12:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 15:12:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-12 15:12:50,270 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-01-12 15:12:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:50,272 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-12 15:12:50,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 15:12:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-12 15:12:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 15:12:50,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:50,274 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:50,275 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:50,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:50,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-01-12 15:12:50,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:50,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:50,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:50,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:50,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:50,826 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:50,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:50,826 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:50,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:50,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:50,935 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:50,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:50,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-12 15:12:50,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 15:12:50,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 15:12:50,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:12:50,958 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 24 states. [2019-01-12 15:12:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:51,736 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-12 15:12:51,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 15:12:51,738 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 123 [2019-01-12 15:12:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:51,739 INFO L225 Difference]: With dead ends: 75 [2019-01-12 15:12:51,739 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 15:12:51,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 15:12:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 15:12:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 15:12:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 15:12:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-12 15:12:51,748 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-01-12 15:12:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:51,749 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-12 15:12:51,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 15:12:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-12 15:12:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 15:12:51,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:51,750 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:51,750 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:51,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:51,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-01-12 15:12:51,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:51,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:51,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-01-12 15:12:52,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:52,534 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:52,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:52,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:52,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:52,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-01-12 15:12:52,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:52,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-01-12 15:12:52,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 15:12:52,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 15:12:52,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2019-01-12 15:12:52,680 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 25 states. [2019-01-12 15:12:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:53,076 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-01-12 15:12:53,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 15:12:53,077 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 129 [2019-01-12 15:12:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:53,079 INFO L225 Difference]: With dead ends: 78 [2019-01-12 15:12:53,079 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 15:12:53,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 15:12:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 15:12:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-12 15:12:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 15:12:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-01-12 15:12:53,096 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2019-01-12 15:12:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:53,097 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-01-12 15:12:53,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 15:12:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-01-12 15:12:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-12 15:12:53,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:53,103 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:53,103 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:53,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:53,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1463802477, now seen corresponding path program 21 times [2019-01-12 15:12:53,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:53,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:53,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:53,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:53,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-01-12 15:12:53,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:53,792 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:53,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:53,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-12 15:12:53,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:53,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-01-12 15:12:53,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:53,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-01-12 15:12:53,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 15:12:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 15:12:53,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:12:53,936 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 26 states. [2019-01-12 15:12:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:54,743 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-01-12 15:12:54,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 15:12:54,745 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 135 [2019-01-12 15:12:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:54,747 INFO L225 Difference]: With dead ends: 81 [2019-01-12 15:12:54,747 INFO L226 Difference]: Without dead ends: 77 [2019-01-12 15:12:54,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 15:12:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-12 15:12:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-12 15:12:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-12 15:12:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-12 15:12:54,755 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 135 [2019-01-12 15:12:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:54,756 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-12 15:12:54,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 15:12:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-12 15:12:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-12 15:12:54,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:54,760 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:54,760 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:54,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash -555819607, now seen corresponding path program 22 times [2019-01-12 15:12:54,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:54,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:54,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:54,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:54,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-01-12 15:12:55,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:55,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:55,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:55,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:55,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:55,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-01-12 15:12:55,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:55,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-01-12 15:12:55,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-12 15:12:55,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-12 15:12:55,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2019-01-12 15:12:55,395 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 27 states. [2019-01-12 15:12:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:55,883 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-01-12 15:12:55,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 15:12:55,884 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 141 [2019-01-12 15:12:55,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:55,886 INFO L225 Difference]: With dead ends: 84 [2019-01-12 15:12:55,886 INFO L226 Difference]: Without dead ends: 80 [2019-01-12 15:12:55,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 15:12:55,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-12 15:12:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-12 15:12:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-12 15:12:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-01-12 15:12:55,892 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 141 [2019-01-12 15:12:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:55,892 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-01-12 15:12:55,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-12 15:12:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-01-12 15:12:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-12 15:12:55,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:55,897 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:55,897 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:55,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:55,897 INFO L82 PathProgramCache]: Analyzing trace with hash -945685357, now seen corresponding path program 23 times [2019-01-12 15:12:55,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:55,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:55,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:55,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:55,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-01-12 15:12:56,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:56,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:56,311 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:56,392 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-01-12 15:12:56,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:56,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-01-12 15:12:56,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:56,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-12 15:12:56,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 15:12:56,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 15:12:56,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:12:56,467 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 28 states. [2019-01-12 15:12:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:57,023 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-01-12 15:12:57,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 15:12:57,025 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 147 [2019-01-12 15:12:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:57,027 INFO L225 Difference]: With dead ends: 87 [2019-01-12 15:12:57,027 INFO L226 Difference]: Without dead ends: 83 [2019-01-12 15:12:57,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 15:12:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-12 15:12:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-12 15:12:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-12 15:12:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-12 15:12:57,033 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 147 [2019-01-12 15:12:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:57,034 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-12 15:12:57,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 15:12:57,034 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-12 15:12:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-01-12 15:12:57,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:57,035 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:57,036 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:57,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:57,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1588806697, now seen corresponding path program 24 times [2019-01-12 15:12:57,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:57,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:57,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:57,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:57,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-01-12 15:12:57,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:57,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:57,605 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:57,677 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-01-12 15:12:57,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:57,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:57,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-01-12 15:12:57,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:57,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-01-12 15:12:57,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 15:12:57,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 15:12:57,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2019-01-12 15:12:57,774 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 29 states. [2019-01-12 15:12:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:58,580 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-01-12 15:12:58,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 15:12:58,581 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 153 [2019-01-12 15:12:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:58,582 INFO L225 Difference]: With dead ends: 90 [2019-01-12 15:12:58,582 INFO L226 Difference]: Without dead ends: 86 [2019-01-12 15:12:58,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 15:12:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-12 15:12:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-12 15:12:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-12 15:12:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-01-12 15:12:58,588 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 153 [2019-01-12 15:12:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:58,588 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-01-12 15:12:58,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 15:12:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-01-12 15:12:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-01-12 15:12:58,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:58,593 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:58,593 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:58,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:58,593 INFO L82 PathProgramCache]: Analyzing trace with hash 959677331, now seen corresponding path program 25 times [2019-01-12 15:12:58,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:58,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:58,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:58,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:58,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 999 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2019-01-12 15:13:01,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:13:01,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:13:01,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:01,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:13:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 949 proven. 50 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2019-01-12 15:13:08,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:13:08,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 116 [2019-01-12 15:13:08,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-12 15:13:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-12 15:13:08,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=843, Invalid=12497, Unknown=0, NotChecked=0, Total=13340 [2019-01-12 15:13:08,113 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 116 states. [2019-01-12 15:13:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:15,348 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2019-01-12 15:13:15,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-12 15:13:15,350 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 159 [2019-01-12 15:13:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:15,351 INFO L225 Difference]: With dead ends: 89 [2019-01-12 15:13:15,351 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:13:15,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4275 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=2079, Invalid=26651, Unknown=0, NotChecked=0, Total=28730 [2019-01-12 15:13:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:13:15,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:13:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:13:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:13:15,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2019-01-12 15:13:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:15,361 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:13:15,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-12 15:13:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:13:15,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:13:15,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:13:15,400 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:13:15,401 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:13:15,401 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2019-01-12 15:13:15,401 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:13:15,401 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-01-12 15:13:15,401 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2019-01-12 15:13:15,402 INFO L444 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (and (<= ULTIMATE.start_main_~a~0 25) (<= 25 ULTIMATE.start_main_~a~0)) [2019-01-12 15:13:15,402 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-12 15:13:15,402 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 18) no Hoare annotation was computed. [2019-01-12 15:13:15,402 INFO L448 ceAbstractionStarter]: For program point sumEXIT(lines 3 9) no Hoare annotation was computed. [2019-01-12 15:13:15,402 INFO L444 ceAbstractionStarter]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (< 0 sum_~n)) [2019-01-12 15:13:15,402 INFO L448 ceAbstractionStarter]: For program point L7-1(line 7) no Hoare annotation was computed. [2019-01-12 15:13:15,402 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 8) no Hoare annotation was computed. [2019-01-12 15:13:15,402 INFO L448 ceAbstractionStarter]: For program point sumFINAL(lines 3 9) no Hoare annotation was computed. [2019-01-12 15:13:15,402 INFO L451 ceAbstractionStarter]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2019-01-12 15:13:15,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:13:15 BoogieIcfgContainer [2019-01-12 15:13:15,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:13:15,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:13:15,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:13:15,409 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:13:15,409 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:35" (3/4) ... [2019-01-12 15:13:15,416 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:13:15,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2019-01-12 15:13:15,430 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:13:15,430 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 15:13:15,476 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:13:15,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:13:15,478 INFO L168 Benchmark]: Toolchain (without parser) took 40919.38 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 485.0 MB). Free memory was 951.4 MB in the beginning and 939.8 MB in the end (delta: 11.6 MB). Peak memory consumption was 496.5 MB. Max. memory is 11.5 GB. [2019-01-12 15:13:15,480 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:13:15,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.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:13:15,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:13:15,482 INFO L168 Benchmark]: Boogie Preprocessor took 24.17 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:13:15,482 INFO L168 Benchmark]: RCFGBuilder took 376.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-01-12 15:13:15,485 INFO L168 Benchmark]: TraceAbstraction took 40153.57 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.4 MB). Free memory was 1.1 GB in the beginning and 939.8 MB in the end (delta: 165.0 MB). Peak memory consumption was 529.4 MB. Max. memory is 11.5 GB. [2019-01-12 15:13:15,486 INFO L168 Benchmark]: Witness Printer took 68.42 ms. Allocated memory is still 1.5 GB. Free memory was 939.8 MB in the beginning and 939.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-12 15:13:15,490 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.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 40.11 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.17 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 376.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40153.57 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.4 MB). Free memory was 1.1 GB in the beginning and 939.8 MB in the end (delta: 165.0 MB). Peak memory consumption was 529.4 MB. Max. memory is 11.5 GB. * Witness Printer took 68.42 ms. Allocated memory is still 1.5 GB. Free memory was 939.8 MB in the beginning and 939.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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, 40.0s OverallTime, 26 OverallIterations, 26 TraceHistogramMax, 17.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 917 SDslu, 3188 SDs, 0 SdLazy, 5651 SolverSat, 325 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3337 GetRequests, 2469 SyntacticMatches, 0 SemanticMatches, 868 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6875 ImplicationChecksByTransitivity, 27.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=25, 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, 26 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 18 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 4359 NumberOfCodeBlocks, 4359 NumberOfCodeBlocksAsserted, 223 NumberOfCheckSat, 4308 ConstructedInterpolants, 0 QuantifiedInterpolants, 1478368 SizeOfPredicates, 403 NumberOfNonLiveVariables, 6550 ConjunctsInSsa, 963 ConjunctsInUnsatCore, 51 InterpolantComputations, 1 PerfectInterpolantSequences, 17751/33800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...