java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/nested-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:17:01,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:17:01,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:17:01,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:17:01,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:17:01,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:17:01,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:17:01,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:17:01,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:17:01,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:17:01,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:17:01,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:17:01,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:17:01,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:17:01,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:17:01,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:17:01,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:17:01,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:17:01,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:17:01,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:17:01,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:17:01,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:17:01,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:17:01,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:17:01,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:17:01,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:17:01,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:17:01,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:17:01,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:17:01,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:17:01,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:17:01,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:17:01,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:17:01,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:17:01,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:17:01,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:17:01,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:17:01,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:17:01,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:17:01,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:17:01,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:17:01,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:17:01,387 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:17:01,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:17:01,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:17:01,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:17:01,389 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:17:01,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:17:01,390 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:17:01,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:17:01,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:17:01,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:17:01,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:17:01,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:17:01,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:17:01,391 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:17:01,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:17:01,392 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:17:01,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:17:01,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:17:01,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:17:01,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:17:01,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:17:01,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:17:01,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:17:01,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:17:01,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:17:01,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:17:01,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:17:01,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:17:01,394 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:17:01,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:17:01,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:17:01,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:17:01,440 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:17:01,440 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:17:01,441 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2019-10-02 11:17:01,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857aee887/161de1a944dc4e3b899fd00cda04f829/FLAG92eadb772 [2019-10-02 11:17:01,952 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:17:01,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2019-10-02 11:17:01,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857aee887/161de1a944dc4e3b899fd00cda04f829/FLAG92eadb772 [2019-10-02 11:17:02,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857aee887/161de1a944dc4e3b899fd00cda04f829 [2019-10-02 11:17:02,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:17:02,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:17:02,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:17:02,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:17:02,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:17:02,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:17:02" (1/1) ... [2019-10-02 11:17:02,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f51de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:02, skipping insertion in model container [2019-10-02 11:17:02,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:17:02" (1/1) ... [2019-10-02 11:17:02,332 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:17:02,347 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:17:02,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:17:02,552 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:17:02,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:17:02,583 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:17:02,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:02 WrapperNode [2019-10-02 11:17:02,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:17:02,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:17:02,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:17:02,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:17:02,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:02" (1/1) ... [2019-10-02 11:17:02,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:02" (1/1) ... [2019-10-02 11:17:02,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:02" (1/1) ... [2019-10-02 11:17:02,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:02" (1/1) ... [2019-10-02 11:17:02,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:02" (1/1) ... [2019-10-02 11:17:02,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:02" (1/1) ... [2019-10-02 11:17:02,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:02" (1/1) ... [2019-10-02 11:17:02,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:17:02,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:17:02,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:17:02,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:17:02,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:02" (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-10-02 11:17:02,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:17:02,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:17:02,763 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:17:02,764 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:17:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:17:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:17:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:17:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:17:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:17:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:17:02,972 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:17:02,973 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 11:17:02,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:17:02 BoogieIcfgContainer [2019-10-02 11:17:02,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:17:02,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:17:02,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:17:02,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:17:02,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:17:02" (1/3) ... [2019-10-02 11:17:02,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aeb391d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:17:02, skipping insertion in model container [2019-10-02 11:17:02,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:02" (2/3) ... [2019-10-02 11:17:02,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aeb391d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:17:02, skipping insertion in model container [2019-10-02 11:17:02,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:17:02" (3/3) ... [2019-10-02 11:17:02,999 INFO L109 eAbstractionObserver]: Analyzing ICFG nested-3.c [2019-10-02 11:17:03,013 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:17:03,022 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:17:03,066 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:17:03,093 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:17:03,094 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:17:03,094 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:17:03,094 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:17:03,094 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:17:03,095 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:17:03,095 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:17:03,095 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:17:03,095 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:17:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-02 11:17:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:17:03,116 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:03,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:03,119 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:03,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:03,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1419324422, now seen corresponding path program 1 times [2019-10-02 11:17:03,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:03,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:03,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:03,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:03,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:03,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:03,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:17:03,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:17:03,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:17:03,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:17:03,303 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-02 11:17:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:03,430 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2019-10-02 11:17:03,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:17:03,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-02 11:17:03,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:03,444 INFO L225 Difference]: With dead ends: 40 [2019-10-02 11:17:03,445 INFO L226 Difference]: Without dead ends: 23 [2019-10-02 11:17:03,450 INFO L640 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-10-02 11:17:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-02 11:17:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-10-02 11:17:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-02 11:17:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-02 11:17:03,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-10-02 11:17:03,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:03,500 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-02 11:17:03,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:17:03,500 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-02 11:17:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:17:03,502 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:03,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:03,504 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:03,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:03,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1519544262, now seen corresponding path program 1 times [2019-10-02 11:17:03,506 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:03,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:03,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:03,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:03,571 INFO L224 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-10-02 11:17:03,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:03,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 11:17:03,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:17:03,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:17:03,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 11:17:03,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:03,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:03,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:03,669 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 5 states. [2019-10-02 11:17:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:03,758 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-10-02 11:17:03,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:03,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-02 11:17:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:03,762 INFO L225 Difference]: With dead ends: 43 [2019-10-02 11:17:03,762 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 11:17:03,763 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 11:17:03,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-10-02 11:17:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-02 11:17:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-10-02 11:17:03,775 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 17 [2019-10-02 11:17:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:03,775 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-10-02 11:17:03,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-10-02 11:17:03,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:17:03,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:03,777 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:03,777 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:03,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash -446333304, now seen corresponding path program 1 times [2019-10-02 11:17:03,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:03,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:03,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:03,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:03,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:03,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:03,867 INFO L224 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-10-02 11:17:03,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:03,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:17:03,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:17:03,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:17:03,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 11:17:03,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:17:03,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:17:03,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:17:03,942 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 9 states. [2019-10-02 11:17:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:04,278 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2019-10-02 11:17:04,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:17:04,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-02 11:17:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:04,281 INFO L225 Difference]: With dead ends: 75 [2019-10-02 11:17:04,282 INFO L226 Difference]: Without dead ends: 57 [2019-10-02 11:17:04,282 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:17:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-02 11:17:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2019-10-02 11:17:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-02 11:17:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-10-02 11:17:04,294 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 20 [2019-10-02 11:17:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:04,295 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-10-02 11:17:04,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:17:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-10-02 11:17:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:17:04,296 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:04,296 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:04,297 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash 290983368, now seen corresponding path program 1 times [2019-10-02 11:17:04,297 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:04,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:04,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:04,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:04,356 INFO L224 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) [2019-10-02 11:17:04,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:04,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:17:04,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:04,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:04,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-10-02 11:17:04,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:04,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:04,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:04,413 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 5 states. [2019-10-02 11:17:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:04,475 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2019-10-02 11:17:04,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:04,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-02 11:17:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:04,477 INFO L225 Difference]: With dead ends: 81 [2019-10-02 11:17:04,477 INFO L226 Difference]: Without dead ends: 43 [2019-10-02 11:17:04,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-02 11:17:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2019-10-02 11:17:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-02 11:17:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-10-02 11:17:04,485 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 20 [2019-10-02 11:17:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:04,485 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-10-02 11:17:04,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:04,486 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2019-10-02 11:17:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 11:17:04,486 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:04,487 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:04,487 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:04,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1592335484, now seen corresponding path program 1 times [2019-10-02 11:17:04,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:04,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:04,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:04,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:04,597 INFO L224 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) [2019-10-02 11:17:04,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:04,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:17:04,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:04,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:04,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2019-10-02 11:17:04,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:17:04,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:17:04,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:17:04,686 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 11 states. [2019-10-02 11:17:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:04,885 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2019-10-02 11:17:04,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:17:04,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-10-02 11:17:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:04,887 INFO L225 Difference]: With dead ends: 85 [2019-10-02 11:17:04,888 INFO L226 Difference]: Without dead ends: 55 [2019-10-02 11:17:04,889 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:17:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-02 11:17:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-10-02 11:17:04,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 11:17:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-10-02 11:17:04,903 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2019-10-02 11:17:04,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:04,903 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-10-02 11:17:04,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:17:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-10-02 11:17:04,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:17:04,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:04,906 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:04,906 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:04,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:04,907 INFO L82 PathProgramCache]: Analyzing trace with hash 183500618, now seen corresponding path program 2 times [2019-10-02 11:17:04,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:04,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:04,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:04,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:04,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:05,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:05,022 INFO L224 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) [2019-10-02 11:17:05,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:05,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:17:05,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:05,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:17:05,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:17:05,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:05,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2019-10-02 11:17:05,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:17:05,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:17:05,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:17:05,122 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 11 states. [2019-10-02 11:17:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:05,549 INFO L93 Difference]: Finished difference Result 155 states and 199 transitions. [2019-10-02 11:17:05,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:17:05,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-10-02 11:17:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:05,554 INFO L225 Difference]: With dead ends: 155 [2019-10-02 11:17:05,554 INFO L226 Difference]: Without dead ends: 119 [2019-10-02 11:17:05,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:17:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-02 11:17:05,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 71. [2019-10-02 11:17:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-02 11:17:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2019-10-02 11:17:05,567 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 26 [2019-10-02 11:17:05,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:05,568 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-10-02 11:17:05,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:17:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2019-10-02 11:17:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:17:05,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:05,569 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:05,569 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:05,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:05,570 INFO L82 PathProgramCache]: Analyzing trace with hash 240758920, now seen corresponding path program 2 times [2019-10-02 11:17:05,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:05,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:05,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:05,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:05,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:05,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:05,618 INFO L224 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) [2019-10-02 11:17:05,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:05,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:17:05,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:05,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 11:17:05,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:05,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:05,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-10-02 11:17:05,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:17:05,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:17:05,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:05,668 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 7 states. [2019-10-02 11:17:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:05,734 INFO L93 Difference]: Finished difference Result 157 states and 197 transitions. [2019-10-02 11:17:05,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:17:05,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-10-02 11:17:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:05,736 INFO L225 Difference]: With dead ends: 157 [2019-10-02 11:17:05,736 INFO L226 Difference]: Without dead ends: 92 [2019-10-02 11:17:05,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-02 11:17:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2019-10-02 11:17:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-02 11:17:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-10-02 11:17:05,751 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 26 [2019-10-02 11:17:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:05,751 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-10-02 11:17:05,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:17:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-10-02 11:17:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 11:17:05,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:05,753 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:05,756 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:05,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:05,757 INFO L82 PathProgramCache]: Analyzing trace with hash 61682426, now seen corresponding path program 3 times [2019-10-02 11:17:05,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:05,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:05,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:05,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:05,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:05,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:05,854 INFO L224 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-10-02 11:17:05,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:17:05,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 11:17:05,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:05,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 11:17:05,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:05,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:17:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 11:17:06,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:17:06,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2019-10-02 11:17:06,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:17:06,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:17:06,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:17:06,015 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 15 states. [2019-10-02 11:17:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:06,287 INFO L93 Difference]: Finished difference Result 258 states and 323 transitions. [2019-10-02 11:17:06,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:17:06,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-10-02 11:17:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:06,291 INFO L225 Difference]: With dead ends: 258 [2019-10-02 11:17:06,291 INFO L226 Difference]: Without dead ends: 181 [2019-10-02 11:17:06,295 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:17:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-02 11:17:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2019-10-02 11:17:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-02 11:17:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 204 transitions. [2019-10-02 11:17:06,337 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 204 transitions. Word has length 29 [2019-10-02 11:17:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:06,338 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 204 transitions. [2019-10-02 11:17:06,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:17:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 204 transitions. [2019-10-02 11:17:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 11:17:06,342 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:06,342 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:06,342 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1068235456, now seen corresponding path program 3 times [2019-10-02 11:17:06,343 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:06,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:06,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:06,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:06,445 INFO L224 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) [2019-10-02 11:17:06,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:06,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 11:17:06,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:06,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:17:06,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:17:06,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:17:06,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2019-10-02 11:17:06,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:17:06,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:17:06,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:17:06,519 INFO L87 Difference]: Start difference. First operand 171 states and 204 transitions. Second operand 14 states. [2019-10-02 11:17:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:07,318 INFO L93 Difference]: Finished difference Result 466 states and 561 transitions. [2019-10-02 11:17:07,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 11:17:07,319 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-10-02 11:17:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:07,324 INFO L225 Difference]: With dead ends: 466 [2019-10-02 11:17:07,324 INFO L226 Difference]: Without dead ends: 377 [2019-10-02 11:17:07,326 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=374, Invalid=1186, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 11:17:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-10-02 11:17:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 287. [2019-10-02 11:17:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-02 11:17:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 340 transitions. [2019-10-02 11:17:07,362 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 340 transitions. Word has length 35 [2019-10-02 11:17:07,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:07,362 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 340 transitions. [2019-10-02 11:17:07,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:17:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 340 transitions. [2019-10-02 11:17:07,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 11:17:07,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:07,366 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:07,366 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:07,369 INFO L82 PathProgramCache]: Analyzing trace with hash 254163580, now seen corresponding path program 4 times [2019-10-02 11:17:07,369 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:07,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:07,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:07,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:07,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:07,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:07,489 INFO L224 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-10-02 11:17:07,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:17:07,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:17:07,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:07,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:17:07,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:07,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:07,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-10-02 11:17:07,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:17:07,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:17:07,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:17:07,565 INFO L87 Difference]: Start difference. First operand 287 states and 340 transitions. Second operand 10 states. [2019-10-02 11:17:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:07,651 INFO L93 Difference]: Finished difference Result 493 states and 595 transitions. [2019-10-02 11:17:07,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:17:07,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-10-02 11:17:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:07,653 INFO L225 Difference]: With dead ends: 493 [2019-10-02 11:17:07,654 INFO L226 Difference]: Without dead ends: 288 [2019-10-02 11:17:07,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:17:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-10-02 11:17:07,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 210. [2019-10-02 11:17:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-02 11:17:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 248 transitions. [2019-10-02 11:17:07,686 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 248 transitions. Word has length 35 [2019-10-02 11:17:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:07,687 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 248 transitions. [2019-10-02 11:17:07,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:17:07,687 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 248 transitions. [2019-10-02 11:17:07,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:17:07,699 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:07,699 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:07,699 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:07,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:07,700 INFO L82 PathProgramCache]: Analyzing trace with hash 168857094, now seen corresponding path program 5 times [2019-10-02 11:17:07,700 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:07,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:07,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:07,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:07,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:07,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:07,825 INFO L224 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) [2019-10-02 11:17:07,854 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:07,871 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-10-02 11:17:07,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:07,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 11:17:07,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:17:07,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:07,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-10-02 11:17:07,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:17:07,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:17:07,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:17:07,893 INFO L87 Difference]: Start difference. First operand 210 states and 248 transitions. Second operand 11 states. [2019-10-02 11:17:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:07,982 INFO L93 Difference]: Finished difference Result 384 states and 463 transitions. [2019-10-02 11:17:07,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:17:07,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-10-02 11:17:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:07,984 INFO L225 Difference]: With dead ends: 384 [2019-10-02 11:17:07,984 INFO L226 Difference]: Without dead ends: 251 [2019-10-02 11:17:07,985 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:17:07,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-02 11:17:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2019-10-02 11:17:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-02 11:17:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2019-10-02 11:17:08,000 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 272 transitions. Word has length 38 [2019-10-02 11:17:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:08,000 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 272 transitions. [2019-10-02 11:17:08,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:17:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 272 transitions. [2019-10-02 11:17:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 11:17:08,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:08,001 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:08,002 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:08,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:08,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1423971900, now seen corresponding path program 6 times [2019-10-02 11:17:08,002 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:08,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:08,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:08,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:08,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:08,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:08,087 INFO L224 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-10-02 11:17:08,122 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:17:08,137 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 11:17:08,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:08,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 11:17:08,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:08,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:17:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 11:17:08,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:17:08,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2019-10-02 11:17:08,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 11:17:08,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 11:17:08,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:17:08,247 INFO L87 Difference]: Start difference. First operand 231 states and 272 transitions. Second operand 19 states. [2019-10-02 11:17:08,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:08,960 INFO L93 Difference]: Finished difference Result 428 states and 517 transitions. [2019-10-02 11:17:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 11:17:08,962 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2019-10-02 11:17:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:08,965 INFO L225 Difference]: With dead ends: 428 [2019-10-02 11:17:08,965 INFO L226 Difference]: Without dead ends: 283 [2019-10-02 11:17:08,966 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=448, Invalid=1192, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 11:17:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-02 11:17:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 261. [2019-10-02 11:17:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-02 11:17:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 306 transitions. [2019-10-02 11:17:08,981 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 306 transitions. Word has length 41 [2019-10-02 11:17:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:08,981 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 306 transitions. [2019-10-02 11:17:08,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 11:17:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 306 transitions. [2019-10-02 11:17:08,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 11:17:08,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:08,983 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:08,983 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:08,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:08,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2030862906, now seen corresponding path program 1 times [2019-10-02 11:17:08,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:08,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:08,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:08,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:08,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-02 11:17:09,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:09,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:17:09,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:17:09,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:17:09,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:17:09,031 INFO L87 Difference]: Start difference. First operand 261 states and 306 transitions. Second operand 4 states. [2019-10-02 11:17:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:09,055 INFO L93 Difference]: Finished difference Result 408 states and 484 transitions. [2019-10-02 11:17:09,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:17:09,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-02 11:17:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:09,057 INFO L225 Difference]: With dead ends: 408 [2019-10-02 11:17:09,058 INFO L226 Difference]: Without dead ends: 268 [2019-10-02 11:17:09,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:17:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-02 11:17:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 257. [2019-10-02 11:17:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-10-02 11:17:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2019-10-02 11:17:09,074 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 47 [2019-10-02 11:17:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:09,074 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2019-10-02 11:17:09,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:17:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2019-10-02 11:17:09,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 11:17:09,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:09,076 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 19, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:09,076 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:09,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:09,077 INFO L82 PathProgramCache]: Analyzing trace with hash 534899273, now seen corresponding path program 1 times [2019-10-02 11:17:09,077 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:09,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:09,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:09,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:09,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:09,366 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 25 proven. 654 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:09,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:09,366 INFO L224 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-10-02 11:17:09,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:09,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 11:17:09,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 353 proven. 176 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-10-02 11:17:09,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:09,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14] total 38 [2019-10-02 11:17:09,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 11:17:09,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 11:17:09,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=1014, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 11:17:09,598 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand 38 states. [2019-10-02 11:17:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:10,703 INFO L93 Difference]: Finished difference Result 691 states and 788 transitions. [2019-10-02 11:17:10,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 11:17:10,703 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2019-10-02 11:17:10,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:10,706 INFO L225 Difference]: With dead ends: 691 [2019-10-02 11:17:10,707 INFO L226 Difference]: Without dead ends: 538 [2019-10-02 11:17:10,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1743, Invalid=4577, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 11:17:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-10-02 11:17:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 290. [2019-10-02 11:17:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-02 11:17:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 338 transitions. [2019-10-02 11:17:10,731 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 338 transitions. Word has length 86 [2019-10-02 11:17:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:10,732 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 338 transitions. [2019-10-02 11:17:10,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 11:17:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 338 transitions. [2019-10-02 11:17:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 11:17:10,734 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:10,734 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 22, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:10,734 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:10,735 INFO L82 PathProgramCache]: Analyzing trace with hash -962165189, now seen corresponding path program 2 times [2019-10-02 11:17:10,735 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:10,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:10,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:10,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:10,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 29 proven. 854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:11,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:11,254 INFO L224 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-10-02 11:17:11,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:17:11,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:17:11,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:11,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:17:11,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 458 proven. 210 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-02 11:17:11,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:11,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 15] total 42 [2019-10-02 11:17:11,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 11:17:11,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 11:17:11,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=1238, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 11:17:11,636 INFO L87 Difference]: Start difference. First operand 290 states and 338 transitions. Second operand 42 states. [2019-10-02 11:17:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:13,061 INFO L93 Difference]: Finished difference Result 782 states and 878 transitions. [2019-10-02 11:17:13,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-02 11:17:13,062 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-10-02 11:17:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:13,066 INFO L225 Difference]: With dead ends: 782 [2019-10-02 11:17:13,066 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 11:17:13,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2424 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2248, Invalid=5942, Unknown=0, NotChecked=0, Total=8190 [2019-10-02 11:17:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 11:17:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 311. [2019-10-02 11:17:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-02 11:17:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 362 transitions. [2019-10-02 11:17:13,100 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 362 transitions. Word has length 95 [2019-10-02 11:17:13,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:13,101 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 362 transitions. [2019-10-02 11:17:13,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 11:17:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 362 transitions. [2019-10-02 11:17:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 11:17:13,102 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:13,103 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 24, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:13,103 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:13,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1040974631, now seen corresponding path program 3 times [2019-10-02 11:17:13,103 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:13,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:13,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 31 proven. 1003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:13,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:13,719 INFO L224 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-10-02 11:17:13,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:17:13,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 11:17:13,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:13,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 11:17:13,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:13,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:17:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 38 proven. 539 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2019-10-02 11:17:14,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:14,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2019-10-02 11:17:14,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 11:17:14,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 11:17:14,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1439, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 11:17:14,034 INFO L87 Difference]: Start difference. First operand 311 states and 362 transitions. Second operand 42 states. [2019-10-02 11:17:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:19,367 INFO L93 Difference]: Finished difference Result 1476 states and 1694 transitions. [2019-10-02 11:17:19,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-10-02 11:17:19,368 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 101 [2019-10-02 11:17:19,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:19,375 INFO L225 Difference]: With dead ends: 1476 [2019-10-02 11:17:19,376 INFO L226 Difference]: Without dead ends: 1388 [2019-10-02 11:17:19,385 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14315 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5745, Invalid=29787, Unknown=0, NotChecked=0, Total=35532 [2019-10-02 11:17:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2019-10-02 11:17:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 752. [2019-10-02 11:17:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-10-02 11:17:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 870 transitions. [2019-10-02 11:17:19,445 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 870 transitions. Word has length 101 [2019-10-02 11:17:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:19,445 INFO L475 AbstractCegarLoop]: Abstraction has 752 states and 870 transitions. [2019-10-02 11:17:19,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 11:17:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 870 transitions. [2019-10-02 11:17:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 11:17:19,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:19,448 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 24, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:19,448 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash 649590111, now seen corresponding path program 1 times [2019-10-02 11:17:19,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:19,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:19,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:19,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:19,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 5 proven. 807 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-02 11:17:19,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:19,701 INFO L224 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-10-02 11:17:19,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:19,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 11:17:19,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 535 proven. 247 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-10-02 11:17:20,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:20,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 33 [2019-10-02 11:17:20,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 11:17:20,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 11:17:20,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 11:17:20,050 INFO L87 Difference]: Start difference. First operand 752 states and 870 transitions. Second operand 33 states. [2019-10-02 11:17:21,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:21,332 INFO L93 Difference]: Finished difference Result 1576 states and 1777 transitions. [2019-10-02 11:17:21,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-02 11:17:21,333 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 101 [2019-10-02 11:17:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:21,338 INFO L225 Difference]: With dead ends: 1576 [2019-10-02 11:17:21,338 INFO L226 Difference]: Without dead ends: 1029 [2019-10-02 11:17:21,340 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1976, Invalid=4504, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 11:17:21,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-10-02 11:17:21,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 518. [2019-10-02 11:17:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-10-02 11:17:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 607 transitions. [2019-10-02 11:17:21,371 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 607 transitions. Word has length 101 [2019-10-02 11:17:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:21,372 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 607 transitions. [2019-10-02 11:17:21,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 11:17:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 607 transitions. [2019-10-02 11:17:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 11:17:21,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:21,374 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 26, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:21,375 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:21,375 INFO L82 PathProgramCache]: Analyzing trace with hash -607875011, now seen corresponding path program 2 times [2019-10-02 11:17:21,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:21,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:21,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:21,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 5 proven. 932 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-02 11:17:21,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:21,608 INFO L224 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-10-02 11:17:21,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:17:21,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:17:21,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:21,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:17:21,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 6 proven. 137 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2019-10-02 11:17:21,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:21,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 6] total 24 [2019-10-02 11:17:21,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 11:17:21,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 11:17:21,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:17:21,737 INFO L87 Difference]: Start difference. First operand 518 states and 607 transitions. Second operand 24 states. [2019-10-02 11:17:23,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:23,664 INFO L93 Difference]: Finished difference Result 3428 states and 3835 transitions. [2019-10-02 11:17:23,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 11:17:23,665 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2019-10-02 11:17:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:23,678 INFO L225 Difference]: With dead ends: 3428 [2019-10-02 11:17:23,679 INFO L226 Difference]: Without dead ends: 3228 [2019-10-02 11:17:23,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1443, Invalid=3527, Unknown=0, NotChecked=0, Total=4970 [2019-10-02 11:17:23,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2019-10-02 11:17:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 1159. [2019-10-02 11:17:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-10-02 11:17:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1312 transitions. [2019-10-02 11:17:23,794 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1312 transitions. Word has length 107 [2019-10-02 11:17:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:23,794 INFO L475 AbstractCegarLoop]: Abstraction has 1159 states and 1312 transitions. [2019-10-02 11:17:23,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 11:17:23,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1312 transitions. [2019-10-02 11:17:23,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 11:17:23,798 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:23,799 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 26, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:23,799 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:23,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:23,799 INFO L82 PathProgramCache]: Analyzing trace with hash -781097223, now seen corresponding path program 3 times [2019-10-02 11:17:23,799 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:23,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:23,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:23,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:23,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 268 proven. 929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:24,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:24,413 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:24,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:17:24,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 11:17:24,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:24,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 11:17:24,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:24,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:17:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 42 proven. 621 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-02 11:17:24,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:24,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 10] total 47 [2019-10-02 11:17:24,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-02 11:17:24,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-02 11:17:24,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1887, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 11:17:24,753 INFO L87 Difference]: Start difference. First operand 1159 states and 1312 transitions. Second operand 47 states. [2019-10-02 11:17:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:36,030 INFO L93 Difference]: Finished difference Result 3581 states and 3982 transitions. [2019-10-02 11:17:36,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 269 states. [2019-10-02 11:17:36,032 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 107 [2019-10-02 11:17:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:36,043 INFO L225 Difference]: With dead ends: 3581 [2019-10-02 11:17:36,043 INFO L226 Difference]: Without dead ends: 3012 [2019-10-02 11:17:36,052 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32965 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12632, Invalid=70600, Unknown=0, NotChecked=0, Total=83232 [2019-10-02 11:17:36,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2019-10-02 11:17:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 1516. [2019-10-02 11:17:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-10-02 11:17:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1707 transitions. [2019-10-02 11:17:36,203 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1707 transitions. Word has length 107 [2019-10-02 11:17:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:36,203 INFO L475 AbstractCegarLoop]: Abstraction has 1516 states and 1707 transitions. [2019-10-02 11:17:36,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-02 11:17:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1707 transitions. [2019-10-02 11:17:36,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 11:17:36,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:36,207 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 26, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:36,207 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:36,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:36,208 INFO L82 PathProgramCache]: Analyzing trace with hash -34225475, now seen corresponding path program 4 times [2019-10-02 11:17:36,208 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:36,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:36,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:36,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:36,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 594 proven. 603 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:36,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:36,595 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:36,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:17:36,696 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:17:36,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:36,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 11:17:36,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 882 proven. 55 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-02 11:17:36,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:36,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 18] total 52 [2019-10-02 11:17:36,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 11:17:36,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 11:17:36,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=2052, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 11:17:36,975 INFO L87 Difference]: Start difference. First operand 1516 states and 1707 transitions. Second operand 52 states. [2019-10-02 11:17:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:39,453 INFO L93 Difference]: Finished difference Result 3193 states and 3621 transitions. [2019-10-02 11:17:39,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-02 11:17:39,454 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 107 [2019-10-02 11:17:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:39,461 INFO L225 Difference]: With dead ends: 3193 [2019-10-02 11:17:39,461 INFO L226 Difference]: Without dead ends: 2336 [2019-10-02 11:17:39,464 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3990 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1690, Invalid=10300, Unknown=0, NotChecked=0, Total=11990 [2019-10-02 11:17:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-10-02 11:17:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 1933. [2019-10-02 11:17:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1933 states. [2019-10-02 11:17:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2178 transitions. [2019-10-02 11:17:39,626 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2178 transitions. Word has length 107 [2019-10-02 11:17:39,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:39,627 INFO L475 AbstractCegarLoop]: Abstraction has 1933 states and 2178 transitions. [2019-10-02 11:17:39,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 11:17:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2178 transitions. [2019-10-02 11:17:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 11:17:39,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:39,630 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 28, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:39,630 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:39,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1161502715, now seen corresponding path program 5 times [2019-10-02 11:17:39,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:39,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:39,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:39,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:39,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 663 proven. 619 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:17:39,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:39,962 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:40,020 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:17:40,049 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-10-02 11:17:40,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:40,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 11:17:40,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 661 proven. 330 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-10-02 11:17:40,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:40,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 18] total 35 [2019-10-02 11:17:40,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 11:17:40,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 11:17:40,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=688, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 11:17:40,075 INFO L87 Difference]: Start difference. First operand 1933 states and 2178 transitions. Second operand 35 states. [2019-10-02 11:17:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:40,317 INFO L93 Difference]: Finished difference Result 3626 states and 4141 transitions. [2019-10-02 11:17:40,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 11:17:40,317 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 110 [2019-10-02 11:17:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:40,323 INFO L225 Difference]: With dead ends: 3626 [2019-10-02 11:17:40,323 INFO L226 Difference]: Without dead ends: 1862 [2019-10-02 11:17:40,326 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=502, Invalid=688, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 11:17:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-10-02 11:17:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1553. [2019-10-02 11:17:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2019-10-02 11:17:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 1742 transitions. [2019-10-02 11:17:40,466 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 1742 transitions. Word has length 110 [2019-10-02 11:17:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:40,466 INFO L475 AbstractCegarLoop]: Abstraction has 1553 states and 1742 transitions. [2019-10-02 11:17:40,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 11:17:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1742 transitions. [2019-10-02 11:17:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 11:17:40,468 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:40,469 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 30, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:40,469 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:40,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:40,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1310224839, now seen corresponding path program 6 times [2019-10-02 11:17:40,469 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:40,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:40,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:40,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:40,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 774 proven. 785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:40,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:40,987 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:41,048 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:17:41,068 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 11:17:41,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:41,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 11:17:41,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:41,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:17:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 48 proven. 805 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2019-10-02 11:17:41,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:41,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 10] total 48 [2019-10-02 11:17:41,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-02 11:17:41,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-02 11:17:41,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 11:17:41,252 INFO L87 Difference]: Start difference. First operand 1553 states and 1742 transitions. Second operand 48 states. [2019-10-02 11:17:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:44,123 INFO L93 Difference]: Finished difference Result 2073 states and 2305 transitions. [2019-10-02 11:17:44,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-10-02 11:17:44,126 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 119 [2019-10-02 11:17:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:44,132 INFO L225 Difference]: With dead ends: 2073 [2019-10-02 11:17:44,132 INFO L226 Difference]: Without dead ends: 1991 [2019-10-02 11:17:44,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9098 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3505, Invalid=19447, Unknown=0, NotChecked=0, Total=22952 [2019-10-02 11:17:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-10-02 11:17:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1611. [2019-10-02 11:17:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2019-10-02 11:17:44,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 1808 transitions. [2019-10-02 11:17:44,239 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 1808 transitions. Word has length 119 [2019-10-02 11:17:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:44,239 INFO L475 AbstractCegarLoop]: Abstraction has 1611 states and 1808 transitions. [2019-10-02 11:17:44,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-02 11:17:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 1808 transitions. [2019-10-02 11:17:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 11:17:44,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:44,244 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 45, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:44,244 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:44,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:44,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1546017896, now seen corresponding path program 4 times [2019-10-02 11:17:44,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:44,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:44,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:44,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:44,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 49 proven. 3498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:17:45,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:45,267 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:45,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:17:45,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:17:45,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:45,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 11:17:45,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 1604 proven. 376 refuted. 0 times theorem prover too weak. 1571 trivial. 0 not checked. [2019-10-02 11:17:45,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:45,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 19] total 72 [2019-10-02 11:17:45,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-02 11:17:45,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-02 11:17:45,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=975, Invalid=4137, Unknown=0, NotChecked=0, Total=5112 [2019-10-02 11:17:45,812 INFO L87 Difference]: Start difference. First operand 1611 states and 1808 transitions. Second operand 72 states. [2019-10-02 11:17:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:48,061 INFO L93 Difference]: Finished difference Result 3767 states and 4198 transitions. [2019-10-02 11:17:48,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-02 11:17:48,061 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 176 [2019-10-02 11:17:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:48,069 INFO L225 Difference]: With dead ends: 3767 [2019-10-02 11:17:48,069 INFO L226 Difference]: Without dead ends: 2367 [2019-10-02 11:17:48,073 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3361, Invalid=13151, Unknown=0, NotChecked=0, Total=16512 [2019-10-02 11:17:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-10-02 11:17:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1608. [2019-10-02 11:17:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-10-02 11:17:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 1804 transitions. [2019-10-02 11:17:48,191 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 1804 transitions. Word has length 176 [2019-10-02 11:17:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:48,192 INFO L475 AbstractCegarLoop]: Abstraction has 1608 states and 1804 transitions. [2019-10-02 11:17:48,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-02 11:17:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1804 transitions. [2019-10-02 11:17:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 11:17:48,196 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:48,196 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 48, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:48,196 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:48,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:48,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1649105992, now seen corresponding path program 5 times [2019-10-02 11:17:48,197 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:48,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:48,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:48,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:48,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4001 backedges. 51 proven. 3946 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:17:49,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:49,562 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:49,637 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:17:49,691 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-10-02 11:17:49,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:49,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 11:17:49,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4001 backedges. 1920 proven. 392 refuted. 0 times theorem prover too weak. 1689 trivial. 0 not checked. [2019-10-02 11:17:50,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:50,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 22] total 79 [2019-10-02 11:17:50,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-02 11:17:50,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-02 11:17:50,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=806, Invalid=5356, Unknown=0, NotChecked=0, Total=6162 [2019-10-02 11:17:50,269 INFO L87 Difference]: Start difference. First operand 1608 states and 1804 transitions. Second operand 79 states. [2019-10-02 11:17:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:55,329 INFO L93 Difference]: Finished difference Result 7096 states and 7917 transitions. [2019-10-02 11:17:55,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-02 11:17:55,329 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 185 [2019-10-02 11:17:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:55,348 INFO L225 Difference]: With dead ends: 7096 [2019-10-02 11:17:55,349 INFO L226 Difference]: Without dead ends: 6025 [2019-10-02 11:17:55,351 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3631 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1734, Invalid=11376, Unknown=0, NotChecked=0, Total=13110 [2019-10-02 11:17:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2019-10-02 11:17:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3690. [2019-10-02 11:17:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3690 states. [2019-10-02 11:17:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 4026 transitions. [2019-10-02 11:17:55,694 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 4026 transitions. Word has length 185 [2019-10-02 11:17:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:55,694 INFO L475 AbstractCegarLoop]: Abstraction has 3690 states and 4026 transitions. [2019-10-02 11:17:55,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-02 11:17:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 4026 transitions. [2019-10-02 11:17:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 11:17:55,702 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:55,702 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 48, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:55,702 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:55,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1736673284, now seen corresponding path program 6 times [2019-10-02 11:17:55,703 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:55,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:55,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:55,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4001 backedges. 103 proven. 3890 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 11:17:56,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:56,879 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:56,958 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:17:56,978 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 11:17:56,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:56,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 11:17:56,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:57,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:17:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4001 backedges. 1867 proven. 1 refuted. 0 times theorem prover too weak. 2133 trivial. 0 not checked. [2019-10-02 11:17:57,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:57,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 10] total 65 [2019-10-02 11:17:57,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-02 11:17:57,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-02 11:17:57,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=3583, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 11:17:57,231 INFO L87 Difference]: Start difference. First operand 3690 states and 4026 transitions. Second operand 65 states. [2019-10-02 11:18:05,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:05,645 INFO L93 Difference]: Finished difference Result 8208 states and 9184 transitions. [2019-10-02 11:18:05,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2019-10-02 11:18:05,646 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 185 [2019-10-02 11:18:05,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:05,646 INFO L225 Difference]: With dead ends: 8208 [2019-10-02 11:18:05,646 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:18:05,659 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21445 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=14732, Invalid=45538, Unknown=0, NotChecked=0, Total=60270 [2019-10-02 11:18:05,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:18:05,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:18:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:18:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:18:05,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 185 [2019-10-02 11:18:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:05,660 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:18:05,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-02 11:18:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:18:05,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:18:05,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:18:06,319 WARN L191 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 447 DAG size of output: 17 [2019-10-02 11:21:26,601 WARN L191 SmtUtils]: Spent 3.34 m on a formula simplification. DAG size of input: 6336 DAG size of output: 4447 [2019-10-02 11:21:27,233 WARN L191 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 607 DAG size of output: 10 [2019-10-02 11:24:26,528 WARN L191 SmtUtils]: Spent 2.99 m on a formula simplification. DAG size of input: 4286 DAG size of output: 137 [2019-10-02 11:24:26,649 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:24:26,649 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:24:26,650 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:24:26,650 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:24:26,650 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (<= ~last~0 0) [2019-10-02 11:24:26,650 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:24:26,650 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:24:26,650 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 16 30) no Hoare annotation was computed. [2019-10-02 11:24:26,650 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 19 29) no Hoare annotation was computed. [2019-10-02 11:24:26,650 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 21 22) no Hoare annotation was computed. [2019-10-02 11:24:26,651 INFO L439 ceAbstractionStarter]: At program point L21-3(lines 21 22) the Hoare annotation is: (let ((.cse26 (+ ~last~0 1))) (let ((.cse6 (<= main_~c~0 (+ ~last~0 2))) (.cse10 (<= 2 main_~c~0)) (.cse2 (<= main_~c~0 (+ ~last~0 6))) (.cse5 (<= 4 main_~c~0)) (.cse8 (<= 9 main_~c~0)) (.cse18 (<= main_~c~0 (+ ~last~0 10))) (.cse16 (<= 10 main_~c~0)) (.cse15 (<= main_~c~0 (+ ~last~0 7))) (.cse21 (<= 7 main_~c~0)) (.cse4 (<= 1 main_~st~0)) (.cse11 (<= 3 main_~c~0)) (.cse23 (<= 1 main_~c~0)) (.cse12 (<= main_~c~0 .cse26)) (.cse7 (+ (* 2 ~last~0) main_~c~0)) (.cse24 (<= main_~c~0 (+ ~last~0 3))) (.cse19 (<= 12 main_~c~0)) (.cse20 (<= main_~c~0 (+ ~last~0 5))) (.cse25 (<= 5 main_~c~0)) (.cse14 (<= ~last~0 1)) (.cse13 (<= 8 main_~c~0)) (.cse17 (<= main_~c~0 (+ ~last~0 8))) (.cse0 (= main_~b~0 main_~a~0)) (.cse1 (<= .cse26 main_~c~0)) (.cse3 (<= main_~c~0 200000)) (.cse9 (<= main_~c~0 (+ ~last~0 9))) (.cse22 (<= 11 main_~c~0))) (or (and .cse0 (and (<= 6 main_~c~0) (and (<= main_~c~0 6) .cse1)) .cse2) (and .cse0 .cse1 .cse3 (<= 13 main_~c~0)) (and .cse0 (<= main_~c~0 0) (<= 0 main_~c~0) .cse4) (and .cse0 (and .cse5 (and .cse1 (<= main_~c~0 4))) .cse6) (and .cse0 (and (<= .cse7 11) .cse8) .cse9) (and (and .cse10 (<= (+ ~last~0 main_~c~0) 3)) .cse0 .cse6) (and .cse10 .cse0 .cse4 (<= main_~c~0 2)) (and .cse0 .cse11 .cse12 (<= (+ (* 3 ~last~0) main_~c~0) 9)) (and .cse0 .cse11 .cse3 .cse4) (and .cse0 .cse2 (and .cse13 .cse1 (<= main_~c~0 8))) (and .cse0 (<= main_~c~0 (+ ~last~0 4)) (and .cse14 .cse5)) (and .cse0 .cse15 (and (and .cse1 .cse8) (<= main_~c~0 9))) (and (and .cse1 (<= main_~c~0 10) .cse16) .cse0 .cse17) (and .cse18 .cse0 (and .cse1 (<= main_~c~0 12) .cse19)) (and .cse0 .cse20 (and .cse21 (<= main_~c~0 7) .cse1)) (and .cse18 (and (<= .cse7 12) .cse16) .cse0) (not (<= |old(~last~0)| 0)) (and (<= main_~c~0 (+ ~last~0 11)) .cse0 (and (<= .cse7 13) .cse22)) (and .cse0 .cse15 (and .cse21 .cse14)) (and (<= main_~c~0 1) .cse0 .cse4 .cse23) (and .cse24 .cse0 (and .cse14 .cse11)) (and .cse0 .cse23 .cse12 (<= .cse7 1)) (and .cse24 .cse0 (and (and (<= main_~c~0 5) .cse1) .cse25)) (and (and .cse14 .cse19) .cse0 (<= main_~c~0 (+ ~last~0 12))) (and .cse0 .cse20 (and .cse14 .cse25)) (and .cse0 (and .cse14 .cse13) .cse17) (and .cse0 .cse1 .cse3 .cse9 .cse22)))) [2019-10-02 11:24:26,651 INFO L443 ceAbstractionStarter]: For program point L21-4(lines 19 29) no Hoare annotation was computed. [2019-10-02 11:24:26,651 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 16 30) no Hoare annotation was computed. [2019-10-02 11:24:26,651 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 16 30) the Hoare annotation is: (or (<= ~last~0 0) (not (<= |old(~last~0)| 0))) [2019-10-02 11:24:26,652 INFO L439 ceAbstractionStarter]: At program point L28(lines 19 29) the Hoare annotation is: (or (and (= main_~b~0 main_~a~0) (<= 200000 main_~c~0) (<= main_~c~0 200000)) (and (= main_~b~0 0) (<= main_~c~0 0) (<= 0 main_~c~0) (= main_~a~0 0)) (not (<= |old(~last~0)| 0))) [2019-10-02 11:24:26,652 INFO L439 ceAbstractionStarter]: At program point L26-1(lines 26 27) the Hoare annotation is: (or (and (= main_~b~0 main_~a~0) (<= 200000 main_~c~0) (<= main_~c~0 200000)) (not (<= |old(~last~0)| 0))) [2019-10-02 11:24:26,652 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-10-02 11:24:26,652 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 14) the Hoare annotation is: true [2019-10-02 11:24:26,652 INFO L443 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2019-10-02 11:24:26,652 INFO L443 ceAbstractionStarter]: For program point L10(lines 10 12) no Hoare annotation was computed. [2019-10-02 11:24:26,652 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 14) no Hoare annotation was computed. [2019-10-02 11:24:26,653 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2019-10-02 11:24:26,653 INFO L443 ceAbstractionStarter]: For program point L10-2(lines 9 14) no Hoare annotation was computed. [2019-10-02 11:24:26,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:24:26 BoogieIcfgContainer [2019-10-02 11:24:26,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:24:26,677 INFO L168 Benchmark]: Toolchain (without parser) took 444358.57 ms. Allocated memory was 134.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 89.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-10-02 11:24:26,678 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:24:26,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.00 ms. Allocated memory is still 134.2 MB. Free memory was 88.9 MB in the beginning and 79.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-02 11:24:26,680 INFO L168 Benchmark]: Boogie Preprocessor took 118.99 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 79.2 MB in the beginning and 177.9 MB in the end (delta: -98.7 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-10-02 11:24:26,680 INFO L168 Benchmark]: RCFGBuilder took 271.23 ms. Allocated memory is still 201.3 MB. Free memory was 177.9 MB in the beginning and 165.0 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:24:26,681 INFO L168 Benchmark]: TraceAbstraction took 443687.50 ms. Allocated memory was 201.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 165.0 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-10-02 11:24:26,685 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 265.00 ms. Allocated memory is still 134.2 MB. Free memory was 88.9 MB in the beginning and 79.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.99 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 79.2 MB in the beginning and 177.9 MB in the end (delta: -98.7 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 271.23 ms. Allocated memory is still 201.3 MB. Free memory was 177.9 MB in the beginning and 165.0 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 443687.50 ms. Allocated memory was 201.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 165.0 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: 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: 19]: Loop Invariant Derived loop invariant: (((b == a && 200000 <= c) && c <= 200000) || (((b == 0 && c <= 0) && 0 <= c) && a == 0)) || !(\old(last) <= 0) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((b == a && 6 <= c && c <= 6 && last + 1 <= c) && c <= last + 6) || (((b == a && last + 1 <= c) && c <= 200000) && 13 <= c)) || (((b == a && c <= 0) && 0 <= c) && 1 <= st)) || ((b == a && 4 <= c && last + 1 <= c && c <= 4) && c <= last + 2)) || ((b == a && 2 * last + c <= 11 && 9 <= c) && c <= last + 9)) || (((2 <= c && last + c <= 3) && b == a) && c <= last + 2)) || (((2 <= c && b == a) && 1 <= st) && c <= 2)) || (((b == a && 3 <= c) && c <= last + 1) && 3 * last + c <= 9)) || (((b == a && 3 <= c) && c <= 200000) && 1 <= st)) || ((b == a && c <= last + 6) && (8 <= c && last + 1 <= c) && c <= 8)) || ((b == a && c <= last + 4) && last <= 1 && 4 <= c)) || ((b == a && c <= last + 7) && (last + 1 <= c && 9 <= c) && c <= 9)) || ((((last + 1 <= c && c <= 10) && 10 <= c) && b == a) && c <= last + 8)) || ((c <= last + 10 && b == a) && (last + 1 <= c && c <= 12) && 12 <= c)) || ((b == a && c <= last + 5) && (7 <= c && c <= 7) && last + 1 <= c)) || ((c <= last + 10 && 2 * last + c <= 12 && 10 <= c) && b == a)) || !(\old(last) <= 0)) || ((c <= last + 11 && b == a) && 2 * last + c <= 13 && 11 <= c)) || ((b == a && c <= last + 7) && 7 <= c && last <= 1)) || (((c <= 1 && b == a) && 1 <= st) && 1 <= c)) || ((c <= last + 3 && b == a) && last <= 1 && 3 <= c)) || (((b == a && 1 <= c) && c <= last + 1) && 2 * last + c <= 1)) || ((c <= last + 3 && b == a) && (c <= 5 && last + 1 <= c) && 5 <= c)) || (((last <= 1 && 12 <= c) && b == a) && c <= last + 12)) || ((b == a && c <= last + 5) && last <= 1 && 5 <= c)) || ((b == a && last <= 1 && 8 <= c) && c <= last + 8)) || ((((b == a && last + 1 <= c) && c <= 200000) && c <= last + 9) && 11 <= c) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. SAFE Result, 443.5s OverallTime, 25 OverallIterations, 51 TraceHistogramMax, 47.1s AutomataDifference, 0.0s DeadEndRemovalTime, 380.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 586 SDtfs, 3348 SDslu, 4796 SDs, 0 SdLazy, 22117 SolverSat, 1594 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3456 GetRequests, 1716 SyntacticMatches, 1 SemanticMatches, 1739 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98285 ImplicationChecksByTransitivity, 36.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3690occurred 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: 1.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 9769 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 295 PreInvPairs, 2914 NumberOfFragments, 533 HoareAnnotationTreeSize, 295 FomulaSimplifications, 11224328263 FormulaSimplificationTreeSizeReduction, 201.5s HoareSimplificationTime, 8 FomulaSimplificationsInter, 646329146 FormulaSimplificationTreeSizeReductionInter, 179.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 3639 NumberOfCodeBlocks, 3149 NumberOfCodeBlocksAsserted, 128 NumberOfCheckSat, 3591 ConstructedInterpolants, 0 QuantifiedInterpolants, 1539404 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 290 ConjunctsInUnsatCore, 48 InterpolantComputations, 7 PerfectInterpolantSequences, 21242/44310 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...