./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.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/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.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 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:47:42,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 05:47:42,567 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 05:47:42,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 05:47:42,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 05:47:42,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 05:47:42,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 05:47:42,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 05:47:42,585 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 05:47:42,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 05:47:42,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 05:47:42,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 05:47:42,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 05:47:42,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 05:47:42,593 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 05:47:42,594 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 05:47:42,595 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 05:47:42,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 05:47:42,599 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 05:47:42,601 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 05:47:42,602 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 05:47:42,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 05:47:42,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 05:47:42,608 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 05:47:42,608 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 05:47:42,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 05:47:42,614 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 05:47:42,615 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 05:47:42,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 05:47:42,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 05:47:42,618 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 05:47:42,619 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 05:47:42,619 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 05:47:42,620 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 05:47:42,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 05:47:42,623 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 05:47:42,626 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 05:47:42,653 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 05:47:42,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 05:47:42,655 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 05:47:42,655 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 05:47:42,655 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 05:47:42,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 05:47:42,656 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 05:47:42,656 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 05:47:42,656 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 05:47:42,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 05:47:42,657 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 05:47:42,657 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 05:47:42,657 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 05:47:42,657 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 05:47:42,657 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 05:47:42,657 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 05:47:42,658 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 05:47:42,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 05:47:42,658 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 05:47:42,658 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 05:47:42,658 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 05:47:42,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 05:47:42,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 05:47:42,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 05:47:42,659 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 05:47:42,659 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 05:47:42,659 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 05:47:42,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 05:47:42,660 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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2019-01-12 05:47:42,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 05:47:42,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 05:47:42,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 05:47:42,717 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 05:47:42,717 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 05:47:42,719 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2019-01-12 05:47:42,783 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ac2dceb/3de70043c33d401c8f9ae18d4c8f03c1/FLAG4848152d8 [2019-01-12 05:47:43,282 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 05:47:43,283 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2019-01-12 05:47:43,296 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ac2dceb/3de70043c33d401c8f9ae18d4c8f03c1/FLAG4848152d8 [2019-01-12 05:47:43,555 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ac2dceb/3de70043c33d401c8f9ae18d4c8f03c1 [2019-01-12 05:47:43,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 05:47:43,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 05:47:43,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 05:47:43,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 05:47:43,564 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 05:47:43,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:47:43" (1/1) ... [2019-01-12 05:47:43,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37fb7911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:43, skipping insertion in model container [2019-01-12 05:47:43,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:47:43" (1/1) ... [2019-01-12 05:47:43,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 05:47:43,626 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 05:47:43,965 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 05:47:43,970 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 05:47:44,035 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 05:47:44,050 INFO L195 MainTranslator]: Completed translation [2019-01-12 05:47:44,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:44 WrapperNode [2019-01-12 05:47:44,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 05:47:44,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 05:47:44,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 05:47:44,052 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 05:47:44,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:44" (1/1) ... [2019-01-12 05:47:44,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:44" (1/1) ... [2019-01-12 05:47:44,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 05:47:44,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 05:47:44,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 05:47:44,237 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 05:47:44,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:44" (1/1) ... [2019-01-12 05:47:44,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:44" (1/1) ... [2019-01-12 05:47:44,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:44" (1/1) ... [2019-01-12 05:47:44,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:44" (1/1) ... [2019-01-12 05:47:44,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:44" (1/1) ... [2019-01-12 05:47:44,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:44" (1/1) ... [2019-01-12 05:47:44,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:44" (1/1) ... [2019-01-12 05:47:44,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 05:47:44,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 05:47:44,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 05:47:44,292 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 05:47:44,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:44" (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 05:47:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 05:47:44,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 05:47:46,187 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 05:47:46,188 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-12 05:47:46,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:47:46 BoogieIcfgContainer [2019-01-12 05:47:46,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 05:47:46,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 05:47:46,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 05:47:46,194 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 05:47:46,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 05:47:43" (1/3) ... [2019-01-12 05:47:46,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bc8cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:47:46, skipping insertion in model container [2019-01-12 05:47:46,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:44" (2/3) ... [2019-01-12 05:47:46,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bc8cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:47:46, skipping insertion in model container [2019-01-12 05:47:46,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:47:46" (3/3) ... [2019-01-12 05:47:46,198 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2019-01-12 05:47:46,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 05:47:46,217 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 05:47:46,234 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 05:47:46,267 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 05:47:46,268 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 05:47:46,268 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 05:47:46,268 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 05:47:46,269 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 05:47:46,269 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 05:47:46,269 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 05:47:46,269 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 05:47:46,269 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 05:47:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-01-12 05:47:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 05:47:46,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:46,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:46,299 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:46,305 INFO L82 PathProgramCache]: Analyzing trace with hash 352571511, now seen corresponding path program 1 times [2019-01-12 05:47:46,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:46,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:46,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:46,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:46,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:46,442 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 05:47:46,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:46,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 05:47:46,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 05:47:46,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 05:47:46,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 05:47:46,464 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 2 states. [2019-01-12 05:47:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:46,494 INFO L93 Difference]: Finished difference Result 216 states and 416 transitions. [2019-01-12 05:47:46,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 05:47:46,496 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-01-12 05:47:46,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:46,509 INFO L225 Difference]: With dead ends: 216 [2019-01-12 05:47:46,510 INFO L226 Difference]: Without dead ends: 100 [2019-01-12 05:47:46,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 05:47:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-12 05:47:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-12 05:47:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-12 05:47:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 165 transitions. [2019-01-12 05:47:46,564 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 165 transitions. Word has length 9 [2019-01-12 05:47:46,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:46,565 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 165 transitions. [2019-01-12 05:47:46,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 05:47:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2019-01-12 05:47:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 05:47:46,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:46,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:46,567 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:46,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:46,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697561, now seen corresponding path program 1 times [2019-01-12 05:47:46,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:46,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:46,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:46,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:46,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:46,660 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 05:47:46,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:46,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:46,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:46,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:46,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:46,663 INFO L87 Difference]: Start difference. First operand 100 states and 165 transitions. Second operand 3 states. [2019-01-12 05:47:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:46,925 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2019-01-12 05:47:46,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:46,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-12 05:47:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:46,928 INFO L225 Difference]: With dead ends: 201 [2019-01-12 05:47:46,928 INFO L226 Difference]: Without dead ends: 103 [2019-01-12 05:47:46,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-12 05:47:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-12 05:47:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-12 05:47:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 168 transitions. [2019-01-12 05:47:46,942 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 168 transitions. Word has length 10 [2019-01-12 05:47:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:46,942 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 168 transitions. [2019-01-12 05:47:46,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:47:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2019-01-12 05:47:46,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 05:47:46,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:46,944 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:46,944 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:46,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:46,945 INFO L82 PathProgramCache]: Analyzing trace with hash 658032730, now seen corresponding path program 1 times [2019-01-12 05:47:46,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:46,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:46,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:46,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:46,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:47,717 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 19 [2019-01-12 05:47:48,929 WARN L181 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 183 DAG size of output: 39 [2019-01-12 05:47:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:48,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:48,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 05:47:48,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 05:47:48,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 05:47:48,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 05:47:48,935 INFO L87 Difference]: Start difference. First operand 103 states and 168 transitions. Second operand 4 states. [2019-01-12 05:47:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:49,418 INFO L93 Difference]: Finished difference Result 205 states and 334 transitions. [2019-01-12 05:47:49,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:49,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-12 05:47:49,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:49,423 INFO L225 Difference]: With dead ends: 205 [2019-01-12 05:47:49,423 INFO L226 Difference]: Without dead ends: 186 [2019-01-12 05:47:49,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 05:47:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-12 05:47:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2019-01-12 05:47:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-12 05:47:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 281 transitions. [2019-01-12 05:47:49,441 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 281 transitions. Word has length 15 [2019-01-12 05:47:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:49,441 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 281 transitions. [2019-01-12 05:47:49,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 05:47:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 281 transitions. [2019-01-12 05:47:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 05:47:49,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:49,443 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:49,443 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:49,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:49,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1675425412, now seen corresponding path program 1 times [2019-01-12 05:47:49,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:49,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:49,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:49,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:49,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:49,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:49,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:49,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:49,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:49,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:49,526 INFO L87 Difference]: Start difference. First operand 172 states and 281 transitions. Second operand 3 states. [2019-01-12 05:47:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:49,618 INFO L93 Difference]: Finished difference Result 293 states and 477 transitions. [2019-01-12 05:47:49,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:49,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-12 05:47:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:49,621 INFO L225 Difference]: With dead ends: 293 [2019-01-12 05:47:49,621 INFO L226 Difference]: Without dead ends: 124 [2019-01-12 05:47:49,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-12 05:47:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-01-12 05:47:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-12 05:47:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2019-01-12 05:47:49,637 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 16 [2019-01-12 05:47:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:49,637 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2019-01-12 05:47:49,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:47:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2019-01-12 05:47:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 05:47:49,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:49,640 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:49,640 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:49,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:49,641 INFO L82 PathProgramCache]: Analyzing trace with hash -843118083, now seen corresponding path program 1 times [2019-01-12 05:47:49,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:49,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:49,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:49,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:47:49,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:49,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:49,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:49,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:49,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:49,733 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand 3 states. [2019-01-12 05:47:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:49,876 INFO L93 Difference]: Finished difference Result 226 states and 358 transitions. [2019-01-12 05:47:49,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:49,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-12 05:47:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:49,877 INFO L225 Difference]: With dead ends: 226 [2019-01-12 05:47:49,878 INFO L226 Difference]: Without dead ends: 107 [2019-01-12 05:47:49,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-12 05:47:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-01-12 05:47:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-12 05:47:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 163 transitions. [2019-01-12 05:47:49,889 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 163 transitions. Word has length 21 [2019-01-12 05:47:49,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:49,890 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 163 transitions. [2019-01-12 05:47:49,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:47:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 163 transitions. [2019-01-12 05:47:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 05:47:49,896 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:49,896 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:49,896 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:49,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:49,897 INFO L82 PathProgramCache]: Analyzing trace with hash -671640130, now seen corresponding path program 1 times [2019-01-12 05:47:49,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:49,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:49,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:49,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:49,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:50,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:47:50,127 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 05:47:50,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:50,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:47:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:50,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:47:50,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-12 05:47:50,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 05:47:50,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 05:47:50,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 05:47:50,292 INFO L87 Difference]: Start difference. First operand 105 states and 163 transitions. Second operand 4 states. [2019-01-12 05:47:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:50,968 INFO L93 Difference]: Finished difference Result 188 states and 295 transitions. [2019-01-12 05:47:50,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 05:47:50,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-12 05:47:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:50,970 INFO L225 Difference]: With dead ends: 188 [2019-01-12 05:47:50,971 INFO L226 Difference]: Without dead ends: 170 [2019-01-12 05:47:50,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 05:47:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-12 05:47:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2019-01-12 05:47:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-12 05:47:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 261 transitions. [2019-01-12 05:47:50,983 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 261 transitions. Word has length 23 [2019-01-12 05:47:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:50,983 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 261 transitions. [2019-01-12 05:47:50,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 05:47:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 261 transitions. [2019-01-12 05:47:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 05:47:50,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:50,984 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:50,986 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash 665435966, now seen corresponding path program 1 times [2019-01-12 05:47:50,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:50,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:50,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:50,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:51,367 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2019-01-12 05:47:51,650 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 38 [2019-01-12 05:47:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:51,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:47:51,656 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 05:47:51,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:51,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:47:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:52,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:47:52,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-12 05:47:52,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 05:47:52,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 05:47:52,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 05:47:52,069 INFO L87 Difference]: Start difference. First operand 168 states and 261 transitions. Second operand 6 states. [2019-01-12 05:47:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:52,767 INFO L93 Difference]: Finished difference Result 226 states and 351 transitions. [2019-01-12 05:47:52,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 05:47:52,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-01-12 05:47:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:52,769 INFO L225 Difference]: With dead ends: 226 [2019-01-12 05:47:52,769 INFO L226 Difference]: Without dead ends: 222 [2019-01-12 05:47:52,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 05:47:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-12 05:47:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2019-01-12 05:47:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-12 05:47:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 335 transitions. [2019-01-12 05:47:52,783 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 335 transitions. Word has length 24 [2019-01-12 05:47:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:52,783 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 335 transitions. [2019-01-12 05:47:52,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 05:47:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 335 transitions. [2019-01-12 05:47:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 05:47:52,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:52,785 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:52,785 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:52,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:52,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1800121285, now seen corresponding path program 1 times [2019-01-12 05:47:52,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:52,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:52,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:52,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:52,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:47:52,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:52,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:52,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:52,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:52,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:52,863 INFO L87 Difference]: Start difference. First operand 213 states and 335 transitions. Second operand 3 states. [2019-01-12 05:47:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:53,131 INFO L93 Difference]: Finished difference Result 387 states and 604 transitions. [2019-01-12 05:47:53,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:53,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-12 05:47:53,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:53,135 INFO L225 Difference]: With dead ends: 387 [2019-01-12 05:47:53,135 INFO L226 Difference]: Without dead ends: 198 [2019-01-12 05:47:53,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-12 05:47:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-01-12 05:47:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-12 05:47:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 297 transitions. [2019-01-12 05:47:53,145 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 297 transitions. Word has length 25 [2019-01-12 05:47:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:53,146 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 297 transitions. [2019-01-12 05:47:53,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:47:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 297 transitions. [2019-01-12 05:47:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 05:47:53,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:53,148 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:53,148 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:53,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:53,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2124865792, now seen corresponding path program 1 times [2019-01-12 05:47:53,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:53,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:53,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:53,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:53,620 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 21 [2019-01-12 05:47:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:53,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:47:53,624 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 05:47:53,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:53,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:47:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 05:47:53,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 05:47:53,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-01-12 05:47:53,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 05:47:53,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 05:47:53,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 05:47:53,884 INFO L87 Difference]: Start difference. First operand 196 states and 297 transitions. Second operand 6 states. [2019-01-12 05:47:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:54,658 INFO L93 Difference]: Finished difference Result 353 states and 538 transitions. [2019-01-12 05:47:54,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 05:47:54,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-01-12 05:47:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:54,665 INFO L225 Difference]: With dead ends: 353 [2019-01-12 05:47:54,665 INFO L226 Difference]: Without dead ends: 337 [2019-01-12 05:47:54,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 05:47:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-01-12 05:47:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 308. [2019-01-12 05:47:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-01-12 05:47:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 467 transitions. [2019-01-12 05:47:54,679 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 467 transitions. Word has length 27 [2019-01-12 05:47:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:54,680 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 467 transitions. [2019-01-12 05:47:54,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 05:47:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 467 transitions. [2019-01-12 05:47:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 05:47:54,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:54,688 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:54,688 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:54,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:54,689 INFO L82 PathProgramCache]: Analyzing trace with hash -917092134, now seen corresponding path program 1 times [2019-01-12 05:47:54,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:54,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:54,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:54,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:54,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 05:47:54,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:54,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:54,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:54,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:54,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:54,796 INFO L87 Difference]: Start difference. First operand 308 states and 467 transitions. Second operand 3 states. [2019-01-12 05:47:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:54,834 INFO L93 Difference]: Finished difference Result 508 states and 774 transitions. [2019-01-12 05:47:54,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:54,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-12 05:47:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:54,838 INFO L225 Difference]: With dead ends: 508 [2019-01-12 05:47:54,838 INFO L226 Difference]: Without dead ends: 242 [2019-01-12 05:47:54,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-12 05:47:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2019-01-12 05:47:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-01-12 05:47:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 360 transitions. [2019-01-12 05:47:54,848 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 360 transitions. Word has length 33 [2019-01-12 05:47:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:54,849 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 360 transitions. [2019-01-12 05:47:54,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:47:54,849 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 360 transitions. [2019-01-12 05:47:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 05:47:54,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:54,852 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:54,852 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:54,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:54,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2082949584, now seen corresponding path program 1 times [2019-01-12 05:47:54,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:54,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:54,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:54,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:54,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:55,144 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 05:47:55,301 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 05:47:55,490 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 17 [2019-01-12 05:47:57,680 WARN L181 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 99 DAG size of output: 34 [2019-01-12 05:47:57,689 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:57,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:47:57,690 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 05:47:57,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:57,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:47:57,910 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-12 05:47:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:57,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:47:57,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-12 05:47:57,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 05:47:57,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 05:47:57,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 05:47:57,994 INFO L87 Difference]: Start difference. First operand 240 states and 360 transitions. Second operand 8 states. [2019-01-12 05:47:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:58,570 INFO L93 Difference]: Finished difference Result 250 states and 369 transitions. [2019-01-12 05:47:58,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 05:47:58,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-01-12 05:47:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:58,575 INFO L225 Difference]: With dead ends: 250 [2019-01-12 05:47:58,575 INFO L226 Difference]: Without dead ends: 248 [2019-01-12 05:47:58,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 05:47:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-12 05:47:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 241. [2019-01-12 05:47:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-12 05:47:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 361 transitions. [2019-01-12 05:47:58,585 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 361 transitions. Word has length 36 [2019-01-12 05:47:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:58,585 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 361 transitions. [2019-01-12 05:47:58,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 05:47:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 361 transitions. [2019-01-12 05:47:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 05:47:58,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:58,587 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:58,587 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:58,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:58,587 INFO L82 PathProgramCache]: Analyzing trace with hash 272165387, now seen corresponding path program 1 times [2019-01-12 05:47:58,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:58,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:58,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:58,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:58,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 05:47:58,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:58,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:58,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:58,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:58,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:58,672 INFO L87 Difference]: Start difference. First operand 241 states and 361 transitions. Second operand 3 states. [2019-01-12 05:47:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:58,966 INFO L93 Difference]: Finished difference Result 424 states and 632 transitions. [2019-01-12 05:47:58,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:58,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-12 05:47:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:58,972 INFO L225 Difference]: With dead ends: 424 [2019-01-12 05:47:58,972 INFO L226 Difference]: Without dead ends: 225 [2019-01-12 05:47:58,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-01-12 05:47:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2019-01-12 05:47:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-01-12 05:47:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 324 transitions. [2019-01-12 05:47:58,985 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 324 transitions. Word has length 37 [2019-01-12 05:47:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:58,985 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 324 transitions. [2019-01-12 05:47:58,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:47:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 324 transitions. [2019-01-12 05:47:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 05:47:58,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:58,989 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:58,989 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:58,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash -140510671, now seen corresponding path program 1 times [2019-01-12 05:47:58,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:58,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:58,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:58,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:58,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-12 05:47:59,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:59,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:59,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:59,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:59,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:59,111 INFO L87 Difference]: Start difference. First operand 223 states and 324 transitions. Second operand 3 states. [2019-01-12 05:47:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:59,397 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2019-01-12 05:47:59,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:59,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-01-12 05:47:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:59,400 INFO L225 Difference]: With dead ends: 305 [2019-01-12 05:47:59,401 INFO L226 Difference]: Without dead ends: 143 [2019-01-12 05:47:59,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-12 05:47:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-01-12 05:47:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-12 05:47:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2019-01-12 05:47:59,411 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 46 [2019-01-12 05:47:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:59,414 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2019-01-12 05:47:59,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:47:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2019-01-12 05:47:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 05:47:59,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:59,417 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:59,418 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:59,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1014660280, now seen corresponding path program 1 times [2019-01-12 05:47:59,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:59,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:59,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:59,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:59,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:00,020 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2019-01-12 05:48:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 05:48:00,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:48:00,026 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 05:48:00,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:00,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:48:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:00,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:48:00,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-01-12 05:48:00,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 05:48:00,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 05:48:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 05:48:00,247 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand 9 states. [2019-01-12 05:48:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:00,364 INFO L93 Difference]: Finished difference Result 184 states and 259 transitions. [2019-01-12 05:48:00,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 05:48:00,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-01-12 05:48:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:00,366 INFO L225 Difference]: With dead ends: 184 [2019-01-12 05:48:00,366 INFO L226 Difference]: Without dead ends: 180 [2019-01-12 05:48:00,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 05:48:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-12 05:48:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2019-01-12 05:48:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-12 05:48:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 250 transitions. [2019-01-12 05:48:00,380 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 250 transitions. Word has length 47 [2019-01-12 05:48:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:00,380 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 250 transitions. [2019-01-12 05:48:00,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 05:48:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 250 transitions. [2019-01-12 05:48:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 05:48:00,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:00,381 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:00,381 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:00,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash 751253453, now seen corresponding path program 1 times [2019-01-12 05:48:00,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:00,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:00,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:00,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:00,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:00,725 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 05:48:00,895 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 05:48:01,109 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 05:48:01,853 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 38 [2019-01-12 05:48:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:01,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:48:01,865 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 05:48:01,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:01,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:48:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:02,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:48:02,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-12 05:48:02,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 05:48:02,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 05:48:02,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-12 05:48:02,130 INFO L87 Difference]: Start difference. First operand 177 states and 250 transitions. Second operand 9 states. [2019-01-12 05:48:03,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:03,484 INFO L93 Difference]: Finished difference Result 180 states and 253 transitions. [2019-01-12 05:48:03,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 05:48:03,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-01-12 05:48:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:03,487 INFO L225 Difference]: With dead ends: 180 [2019-01-12 05:48:03,489 INFO L226 Difference]: Without dead ends: 178 [2019-01-12 05:48:03,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-12 05:48:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-12 05:48:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-01-12 05:48:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-12 05:48:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 251 transitions. [2019-01-12 05:48:03,503 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 251 transitions. Word has length 57 [2019-01-12 05:48:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:03,504 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 251 transitions. [2019-01-12 05:48:03,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 05:48:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 251 transitions. [2019-01-12 05:48:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-12 05:48:03,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:03,505 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:03,506 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:03,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:03,506 INFO L82 PathProgramCache]: Analyzing trace with hash 384172331, now seen corresponding path program 1 times [2019-01-12 05:48:03,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:03,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:03,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:03,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:03,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:04,200 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 32 [2019-01-12 05:48:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 57 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 05:48:04,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:48:04,212 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 05:48:04,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:04,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:48:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:04,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:48:04,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-12 05:48:04,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 05:48:04,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 05:48:04,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-01-12 05:48:04,868 INFO L87 Difference]: Start difference. First operand 178 states and 251 transitions. Second operand 14 states. [2019-01-12 05:48:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:05,267 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2019-01-12 05:48:05,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 05:48:05,269 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-01-12 05:48:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:05,271 INFO L225 Difference]: With dead ends: 199 [2019-01-12 05:48:05,271 INFO L226 Difference]: Without dead ends: 196 [2019-01-12 05:48:05,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-01-12 05:48:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-12 05:48:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-01-12 05:48:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-12 05:48:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 276 transitions. [2019-01-12 05:48:05,280 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 276 transitions. Word has length 66 [2019-01-12 05:48:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:05,280 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 276 transitions. [2019-01-12 05:48:05,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 05:48:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 276 transitions. [2019-01-12 05:48:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 05:48:05,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:05,282 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:05,284 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:05,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:05,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1365307632, now seen corresponding path program 1 times [2019-01-12 05:48:05,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:05,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:05,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:05,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:05,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-12 05:48:05,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:48:05,580 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 05:48:05,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:05,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:48:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-12 05:48:05,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:48:05,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-12 05:48:05,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 05:48:05,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 05:48:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-12 05:48:05,885 INFO L87 Difference]: Start difference. First operand 196 states and 276 transitions. Second operand 8 states. [2019-01-12 05:48:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:07,488 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2019-01-12 05:48:07,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 05:48:07,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2019-01-12 05:48:07,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:07,490 INFO L225 Difference]: With dead ends: 221 [2019-01-12 05:48:07,490 INFO L226 Difference]: Without dead ends: 218 [2019-01-12 05:48:07,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-12 05:48:07,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-01-12 05:48:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2019-01-12 05:48:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-12 05:48:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 301 transitions. [2019-01-12 05:48:07,499 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 301 transitions. Word has length 75 [2019-01-12 05:48:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:07,499 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 301 transitions. [2019-01-12 05:48:07,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 05:48:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 301 transitions. [2019-01-12 05:48:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-12 05:48:07,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:07,500 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:07,503 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:07,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2057891779, now seen corresponding path program 1 times [2019-01-12 05:48:07,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:07,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:07,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:07,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:07,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:07,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:48:07,844 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 05:48:07,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:07,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:48:08,606 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 05:48:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:08,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:48:08,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2019-01-12 05:48:08,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 05:48:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 05:48:08,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-01-12 05:48:08,690 INFO L87 Difference]: Start difference. First operand 214 states and 301 transitions. Second operand 11 states. [2019-01-12 05:48:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:09,081 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2019-01-12 05:48:09,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 05:48:09,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2019-01-12 05:48:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:09,084 INFO L225 Difference]: With dead ends: 217 [2019-01-12 05:48:09,085 INFO L226 Difference]: Without dead ends: 215 [2019-01-12 05:48:09,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-01-12 05:48:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-12 05:48:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-01-12 05:48:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-12 05:48:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 302 transitions. [2019-01-12 05:48:09,096 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 302 transitions. Word has length 78 [2019-01-12 05:48:09,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:09,096 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 302 transitions. [2019-01-12 05:48:09,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 05:48:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 302 transitions. [2019-01-12 05:48:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-12 05:48:09,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:09,123 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:09,124 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:09,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash 595683003, now seen corresponding path program 1 times [2019-01-12 05:48:09,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:09,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:09,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:09,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:09,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:10,128 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-12 05:48:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-12 05:48:10,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:48:10,146 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 05:48:10,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:10,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:48:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:10,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:48:10,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2019-01-12 05:48:10,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 05:48:10,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 05:48:10,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-01-12 05:48:10,555 INFO L87 Difference]: Start difference. First operand 215 states and 302 transitions. Second operand 15 states. [2019-01-12 05:48:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:10,729 INFO L93 Difference]: Finished difference Result 258 states and 362 transitions. [2019-01-12 05:48:10,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 05:48:10,731 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2019-01-12 05:48:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:10,733 INFO L225 Difference]: With dead ends: 258 [2019-01-12 05:48:10,733 INFO L226 Difference]: Without dead ends: 254 [2019-01-12 05:48:10,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-01-12 05:48:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-12 05:48:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-01-12 05:48:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-12 05:48:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 353 transitions. [2019-01-12 05:48:10,742 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 353 transitions. Word has length 89 [2019-01-12 05:48:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:10,742 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 353 transitions. [2019-01-12 05:48:10,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 05:48:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 353 transitions. [2019-01-12 05:48:10,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 05:48:10,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:10,745 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:10,745 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:10,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:10,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1136679040, now seen corresponding path program 2 times [2019-01-12 05:48:10,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:10,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:10,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:10,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:10,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:11,799 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 39 [2019-01-12 05:48:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:11,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:48:11,823 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 05:48:11,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 05:48:11,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 05:48:11,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 05:48:11,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:48:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:12,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:48:12,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 15 [2019-01-12 05:48:12,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 05:48:12,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 05:48:12,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-01-12 05:48:12,455 INFO L87 Difference]: Start difference. First operand 251 states and 353 transitions. Second operand 15 states. [2019-01-12 05:48:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:13,148 INFO L93 Difference]: Finished difference Result 254 states and 356 transitions. [2019-01-12 05:48:13,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 05:48:13,149 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2019-01-12 05:48:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:13,151 INFO L225 Difference]: With dead ends: 254 [2019-01-12 05:48:13,151 INFO L226 Difference]: Without dead ends: 252 [2019-01-12 05:48:13,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-01-12 05:48:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-01-12 05:48:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2019-01-12 05:48:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-12 05:48:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 354 transitions. [2019-01-12 05:48:13,162 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 354 transitions. Word has length 99 [2019-01-12 05:48:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:13,162 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 354 transitions. [2019-01-12 05:48:13,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 05:48:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 354 transitions. [2019-01-12 05:48:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-12 05:48:13,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:13,165 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:13,165 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:13,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash 366250712, now seen corresponding path program 2 times [2019-01-12 05:48:13,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:13,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:13,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 05:48:13,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:13,462 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 05:48:13,629 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 05:48:13,820 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 05:48:14,404 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-01-12 05:48:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:14,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:48:14,454 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 05:48:14,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 05:48:14,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 05:48:14,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 05:48:14,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:48:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:15,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:48:15,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-01-12 05:48:15,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 05:48:15,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 05:48:15,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-01-12 05:48:15,063 INFO L87 Difference]: Start difference. First operand 252 states and 354 transitions. Second operand 14 states. [2019-01-12 05:48:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:15,390 INFO L93 Difference]: Finished difference Result 273 states and 383 transitions. [2019-01-12 05:48:15,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 05:48:15,391 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 108 [2019-01-12 05:48:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:15,394 INFO L225 Difference]: With dead ends: 273 [2019-01-12 05:48:15,394 INFO L226 Difference]: Without dead ends: 270 [2019-01-12 05:48:15,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-01-12 05:48:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-12 05:48:15,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-01-12 05:48:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-01-12 05:48:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2019-01-12 05:48:15,403 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 379 transitions. Word has length 108 [2019-01-12 05:48:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:15,404 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 379 transitions. [2019-01-12 05:48:15,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 05:48:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 379 transitions. [2019-01-12 05:48:15,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 05:48:15,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:15,408 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:15,408 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:15,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:15,408 INFO L82 PathProgramCache]: Analyzing trace with hash -23324669, now seen corresponding path program 2 times [2019-01-12 05:48:15,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:15,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:15,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 05:48:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-12 05:48:16,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:48:16,172 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 05:48:16,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 05:48:16,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 05:48:16,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 05:48:16,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:48:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-12 05:48:16,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:48:16,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-12 05:48:16,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 05:48:16,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 05:48:16,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-12 05:48:16,390 INFO L87 Difference]: Start difference. First operand 270 states and 379 transitions. Second operand 10 states. [2019-01-12 05:48:16,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:16,702 INFO L93 Difference]: Finished difference Result 295 states and 411 transitions. [2019-01-12 05:48:16,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 05:48:16,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 117 [2019-01-12 05:48:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:16,707 INFO L225 Difference]: With dead ends: 295 [2019-01-12 05:48:16,707 INFO L226 Difference]: Without dead ends: 292 [2019-01-12 05:48:16,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-12 05:48:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-01-12 05:48:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2019-01-12 05:48:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-12 05:48:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2019-01-12 05:48:16,721 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 117 [2019-01-12 05:48:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:16,721 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2019-01-12 05:48:16,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 05:48:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2019-01-12 05:48:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-12 05:48:16,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:16,726 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:16,726 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:16,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash -599032214, now seen corresponding path program 2 times [2019-01-12 05:48:16,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:16,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:16,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:16,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 05:48:16,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:17,104 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 05:48:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:17,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:48:17,436 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 05:48:17,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 05:48:17,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 05:48:17,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 05:48:17,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:48:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:17,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:48:17,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 15 [2019-01-12 05:48:17,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 05:48:17,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 05:48:17,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-01-12 05:48:17,752 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand 15 states. [2019-01-12 05:48:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:18,004 INFO L93 Difference]: Finished difference Result 291 states and 407 transitions. [2019-01-12 05:48:18,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 05:48:18,005 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 120 [2019-01-12 05:48:18,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:18,008 INFO L225 Difference]: With dead ends: 291 [2019-01-12 05:48:18,008 INFO L226 Difference]: Without dead ends: 289 [2019-01-12 05:48:18,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-01-12 05:48:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-12 05:48:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-01-12 05:48:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-01-12 05:48:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 405 transitions. [2019-01-12 05:48:18,021 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 405 transitions. Word has length 120 [2019-01-12 05:48:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:18,021 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 405 transitions. [2019-01-12 05:48:18,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 05:48:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 405 transitions. [2019-01-12 05:48:18,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-12 05:48:18,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:18,025 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:18,025 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:18,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1532381806, now seen corresponding path program 2 times [2019-01-12 05:48:18,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:18,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:18,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 05:48:18,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:18,416 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-01-12 05:48:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-12 05:48:18,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:48:18,545 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 05:48:18,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 05:48:18,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 05:48:18,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 05:48:18,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:48:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 339 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:19,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:48:19,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2019-01-12 05:48:19,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 05:48:19,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 05:48:19,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-01-12 05:48:19,012 INFO L87 Difference]: Start difference. First operand 289 states and 405 transitions. Second operand 21 states. [2019-01-12 05:48:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:19,369 INFO L93 Difference]: Finished difference Result 332 states and 465 transitions. [2019-01-12 05:48:19,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 05:48:19,370 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 131 [2019-01-12 05:48:19,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:19,373 INFO L225 Difference]: With dead ends: 332 [2019-01-12 05:48:19,374 INFO L226 Difference]: Without dead ends: 328 [2019-01-12 05:48:19,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-01-12 05:48:19,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-12 05:48:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 325. [2019-01-12 05:48:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-12 05:48:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 456 transitions. [2019-01-12 05:48:19,385 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 456 transitions. Word has length 131 [2019-01-12 05:48:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:19,387 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 456 transitions. [2019-01-12 05:48:19,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 05:48:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 456 transitions. [2019-01-12 05:48:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-12 05:48:19,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:19,390 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:19,390 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:19,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash 561891187, now seen corresponding path program 3 times [2019-01-12 05:48:19,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:19,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:19,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:19,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 05:48:19,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:19,763 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 05:48:22,449 WARN L181 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 183 DAG size of output: 40 [2019-01-12 05:48:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:22,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:48:22,494 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 05:48:22,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 05:48:22,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 05:48:22,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 05:48:22,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:48:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 208 proven. 26 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-01-12 05:48:22,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 05:48:22,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 21 [2019-01-12 05:48:22,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 05:48:22,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 05:48:22,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-01-12 05:48:22,994 INFO L87 Difference]: Start difference. First operand 325 states and 456 transitions. Second operand 21 states. [2019-01-12 05:48:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:24,018 INFO L93 Difference]: Finished difference Result 334 states and 466 transitions. [2019-01-12 05:48:24,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 05:48:24,019 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 141 [2019-01-12 05:48:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:24,020 INFO L225 Difference]: With dead ends: 334 [2019-01-12 05:48:24,020 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 05:48:24,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 05:48:24,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 05:48:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 05:48:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 05:48:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 05:48:24,022 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2019-01-12 05:48:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:24,022 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 05:48:24,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 05:48:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 05:48:24,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 05:48:24,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 05:48:24,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:48:24,540 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 48 [2019-01-12 05:48:24,635 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2019-01-12 05:48:24,635 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-01-12 05:48:24,635 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-01-12 05:48:24,635 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2019-01-12 05:48:24,635 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2019-01-12 05:48:24,635 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2019-01-12 05:48:24,635 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2019-01-12 05:48:24,636 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2019-01-12 05:48:24,636 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2019-01-12 05:48:24,636 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2019-01-12 05:48:24,636 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2019-01-12 05:48:24,636 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2019-01-12 05:48:24,636 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2019-01-12 05:48:24,636 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2019-01-12 05:48:24,637 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2019-01-12 05:48:24,637 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2019-01-12 05:48:24,637 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2019-01-12 05:48:24,637 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2019-01-12 05:48:24,637 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2019-01-12 05:48:24,637 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2019-01-12 05:48:24,637 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2019-01-12 05:48:24,637 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2019-01-12 05:48:24,637 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2019-01-12 05:48:24,637 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2019-01-12 05:48:24,637 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2019-01-12 05:48:24,637 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2019-01-12 05:48:24,638 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2019-01-12 05:48:24,638 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2019-01-12 05:48:24,638 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-01-12 05:48:24,638 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-01-12 05:48:24,638 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2019-01-12 05:48:24,638 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-01-12 05:48:24,638 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2019-01-12 05:48:24,638 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2019-01-12 05:48:24,638 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2019-01-12 05:48:24,639 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2019-01-12 05:48:24,639 INFO L451 ceAbstractionStarter]: At program point L14(lines 14 566) the Hoare annotation is: true [2019-01-12 05:48:24,639 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2019-01-12 05:48:24,639 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2019-01-12 05:48:24,639 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2019-01-12 05:48:24,639 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2019-01-12 05:48:24,639 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2019-01-12 05:48:24,639 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-01-12 05:48:24,639 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2019-01-12 05:48:24,640 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2019-01-12 05:48:24,640 INFO L448 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-01-12 05:48:24,640 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-01-12 05:48:24,640 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2019-01-12 05:48:24,640 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2019-01-12 05:48:24,640 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 05:48:24,640 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-01-12 05:48:24,640 INFO L444 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2019-01-12 05:48:24,640 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-01-12 05:48:24,640 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-01-12 05:48:24,640 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2019-01-12 05:48:24,641 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 05:48:24,641 INFO L444 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ULTIMATE.start_main_~this_buffer_empty~0 4294967296) 1))) (.cse1 (<= ULTIMATE.start_main_~this_buffer_empty~0 0))) (or (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 .cse1 (exists ((v_prenex_29 Int)) (let ((.cse2 (mod v_prenex_29 2))) (and (= 0 .cse2) (= .cse2 (mod ULTIMATE.start_main_~this_expect~0 2))))) (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648)) (<= ULTIMATE.start_main_~P8~0 2147483647)) (and (<= 0 ULTIMATE.start_main_~this_expect~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0) .cse1))) [2019-01-12 05:48:24,641 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2019-01-12 05:48:24,641 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 05:48:24,641 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2019-01-12 05:48:24,641 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2019-01-12 05:48:24,641 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2019-01-12 05:48:24,641 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2019-01-12 05:48:24,641 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2019-01-12 05:48:24,641 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2019-01-12 05:48:24,642 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2019-01-12 05:48:24,642 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2019-01-12 05:48:24,642 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2019-01-12 05:48:24,642 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2019-01-12 05:48:24,642 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2019-01-12 05:48:24,642 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2019-01-12 05:48:24,642 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-01-12 05:48:24,642 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2019-01-12 05:48:24,642 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2019-01-12 05:48:24,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 05:48:24,643 INFO L444 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ULTIMATE.start_main_~this_buffer_empty~0 4294967296) 1))) (.cse2 (<= ULTIMATE.start_main_~this_buffer_empty~0 0)) (.cse7 (exists ((v_prenex_29 Int)) (let ((.cse9 (mod v_prenex_29 2))) (and (= 0 .cse9) (= .cse9 (mod ULTIMATE.start_main_~this_expect~0 2)))))) (.cse5 (<= ULTIMATE.start_main_~this_buffer_empty~0 1)) (.cse6 (<= 1 ULTIMATE.start_main_~this_buffer_empty~0)) (.cse1 (exists ((v_prenex_29 Int)) (let ((.cse8 (mod v_prenex_29 2))) (and (= (mod (+ ULTIMATE.start_main_~this_expect~0 1) 2) .cse8) (= 0 .cse8))))) (.cse3 (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648))) (.cse4 (<= ULTIMATE.start_main_~P8~0 2147483647))) (or (and (= ULTIMATE.start_main_~q~0 3) .cse0 .cse1 .cse2 .cse3 .cse4) (and (and (= ULTIMATE.start_main_~q~0 1) .cse5 .cse6 .cse3 .cse4) .cse7) (and (<= 0 ULTIMATE.start_main_~this_expect~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0) .cse2) (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 .cse2 .cse7 .cse3 .cse4) (and .cse5 (= ULTIMATE.start_main_~q~0 4) .cse6 .cse1 .cse3 .cse4))) [2019-01-12 05:48:24,643 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2019-01-12 05:48:24,643 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2019-01-12 05:48:24,643 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2019-01-12 05:48:24,643 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2019-01-12 05:48:24,643 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2019-01-12 05:48:24,643 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2019-01-12 05:48:24,643 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2019-01-12 05:48:24,643 INFO L448 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2019-01-12 05:48:24,643 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2019-01-12 05:48:24,643 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2019-01-12 05:48:24,644 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2019-01-12 05:48:24,644 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2019-01-12 05:48:24,644 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2019-01-12 05:48:24,644 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2019-01-12 05:48:24,644 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2019-01-12 05:48:24,644 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2019-01-12 05:48:24,644 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2019-01-12 05:48:24,644 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-01-12 05:48:24,644 INFO L448 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2019-01-12 05:48:24,644 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2019-01-12 05:48:24,644 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2019-01-12 05:48:24,644 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2019-01-12 05:48:24,645 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 05:48:24,645 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-01-12 05:48:24,645 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2019-01-12 05:48:24,645 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2019-01-12 05:48:24,645 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-01-12 05:48:24,645 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2019-01-12 05:48:24,645 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2019-01-12 05:48:24,645 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2019-01-12 05:48:24,645 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2019-01-12 05:48:24,645 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-01-12 05:48:24,645 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-01-12 05:48:24,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 05:48:24 BoogieIcfgContainer [2019-01-12 05:48:24,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 05:48:24,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 05:48:24,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 05:48:24,670 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 05:48:24,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:47:46" (3/4) ... [2019-01-12 05:48:24,674 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 05:48:24,716 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 05:48:24,716 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 05:48:24,753 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((5 <= q && 0 < this_buffer_empty / 4294967296 + 1) && this_buffer_empty <= 0) && (\exists v_prenex_29 : int :: 0 == v_prenex_29 % 2 && v_prenex_29 % 2 == this_expect % 2)) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || ((((0 <= this_expect && 0 < this_buffer_empty / 4294967296 + 1) && this_expect <= 0) && q == 0) && this_buffer_empty <= 0) [2019-01-12 05:48:24,764 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 05:48:24,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 05:48:24,766 INFO L168 Benchmark]: Toolchain (without parser) took 41207.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 408.4 MB). Free memory was 954.0 MB in the beginning and 1.3 GB in the end (delta: -316.1 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:24,767 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 05:48:24,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 491.01 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 932.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:24,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 184.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:24,769 INFO L168 Benchmark]: Boogie Preprocessor took 54.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:24,772 INFO L168 Benchmark]: RCFGBuilder took 1898.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:24,772 INFO L168 Benchmark]: TraceAbstraction took 38478.84 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 304.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -252.1 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:24,774 INFO L168 Benchmark]: Witness Printer took 94.31 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 05:48:24,779 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 491.01 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 932.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 184.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1898.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38478.84 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 304.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -252.1 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * Witness Printer took 94.31 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant [2019-01-12 05:48:24,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] Derived loop invariant: ((((((((q == 3 && 0 < this_buffer_empty / 4294967296 + 1) && (\exists v_prenex_29 : int :: (this_expect + 1) % 2 == v_prenex_29 % 2 && 0 == v_prenex_29 % 2)) && this_buffer_empty <= 0) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || (((((q == 1 && this_buffer_empty <= 1) && 1 <= this_buffer_empty) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && (\exists v_prenex_29 : int :: 0 == v_prenex_29 % 2 && v_prenex_29 % 2 == this_expect % 2))) || ((((0 <= this_expect && 0 < this_buffer_empty / 4294967296 + 1) && this_expect <= 0) && q == 0) && this_buffer_empty <= 0)) || (((((5 <= q && 0 < this_buffer_empty / 4294967296 + 1) && this_buffer_empty <= 0) && (\exists v_prenex_29 : int :: 0 == v_prenex_29 % 2 && v_prenex_29 % 2 == this_expect % 2)) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || (((((this_buffer_empty <= 1 && q == 4) && 1 <= this_buffer_empty) && (\exists v_prenex_29 : int :: (this_expect + 1) % 2 == v_prenex_29 % 2 && 0 == v_prenex_29 % 2)) && 0 <= P8 + 2147483648) && P8 <= 2147483647) - InvariantResult [Line: 24]: Loop Invariant [2019-01-12 05:48:24,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 05:48:24,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] Derived loop invariant: (((((5 <= q && 0 < this_buffer_empty / 4294967296 + 1) && this_buffer_empty <= 0) && (\exists v_prenex_29 : int :: 0 == v_prenex_29 % 2 && v_prenex_29 % 2 == this_expect % 2)) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || ((((0 <= this_expect && 0 < this_buffer_empty / 4294967296 + 1) && this_expect <= 0) && q == 0) && this_buffer_empty <= 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 1 error locations. SAFE Result, 38.3s OverallTime, 25 OverallIterations, 14 TraceHistogramMax, 11.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 4759 SDtfs, 3506 SDslu, 25812 SDs, 0 SdLazy, 3286 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1424 GetRequests, 1219 SyntacticMatches, 25 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 90 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 36 NumberOfFragments, 221 HoareAnnotationTreeSize, 4 FomulaSimplifications, 697 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 912 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 21.9s InterpolantComputationTime, 2688 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2647 ConstructedInterpolants, 42 QuantifiedInterpolants, 2472456 SizeOfPredicates, 59 NumberOfNonLiveVariables, 7629 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 41 InterpolantComputations, 10 PerfectInterpolantSequences, 1030/4848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...