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-lit/mcmillan2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:03:47,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:03:47,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:03:47,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:03:47,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:03:47,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:03:47,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:03:47,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:03:47,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:03:47,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:03:47,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:03:47,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:03:47,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:03:47,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:03:47,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:03:47,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:03:47,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:03:47,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:03:47,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:03:47,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:03:47,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:03:47,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:03:47,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:03:47,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:03:47,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:03:47,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:03:47,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:03:47,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:03:47,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:03:47,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:03:47,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:03:47,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:03:47,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:03:47,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:03:47,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:03:47,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:03:47,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:03:47,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:03:47,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:03:47,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:03:47,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:03:47,412 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-09-05 12:03:47,434 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:03:47,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:03:47,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 12:03:47,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 12:03:47,437 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 12:03:47,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:03:47,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:03:47,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 12:03:47,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:03:47,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:03:47,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:03:47,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:03:47,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:03:47,440 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:03:47,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:03:47,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 12:03:47,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:03:47,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:03:47,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:03:47,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 12:03:47,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 12:03:47,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:03:47,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:03:47,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:03:47,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 12:03:47,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 12:03:47,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:03:47,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:03:47,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 12:03:47,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:03:47,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:03:47,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:03:47,508 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:03:47,508 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:03:47,509 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i [2019-09-05 12:03:47,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f0ca6c9/0cdab6ded99840d7add980a50332067a/FLAG1afdd18ea [2019-09-05 12:03:47,996 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:03:47,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i [2019-09-05 12:03:48,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f0ca6c9/0cdab6ded99840d7add980a50332067a/FLAG1afdd18ea [2019-09-05 12:03:48,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f0ca6c9/0cdab6ded99840d7add980a50332067a [2019-09-05 12:03:48,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:03:48,438 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:03:48,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:03:48,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:03:48,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:03:48,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:03:48" (1/1) ... [2019-09-05 12:03:48,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ed881d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:48, skipping insertion in model container [2019-09-05 12:03:48,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:03:48" (1/1) ... [2019-09-05 12:03:48,453 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:03:48,467 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:03:48,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:03:48,646 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:03:48,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:03:48,679 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:03:48,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:48 WrapperNode [2019-09-05 12:03:48,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:03:48,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:03:48,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:03:48,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:03:48,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:48" (1/1) ... [2019-09-05 12:03:48,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:48" (1/1) ... [2019-09-05 12:03:48,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:48" (1/1) ... [2019-09-05 12:03:48,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:48" (1/1) ... [2019-09-05 12:03:48,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:48" (1/1) ... [2019-09-05 12:03:48,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:48" (1/1) ... [2019-09-05 12:03:48,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:48" (1/1) ... [2019-09-05 12:03:48,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:03:48,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:03:48,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:03:48,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:03:48,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:48" (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-09-05 12:03:48,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:03:48,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:03:48,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:03:48,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:03:48,864 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-05 12:03:48,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:03:48,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 12:03:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:03:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 12:03:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:03:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-05 12:03:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 12:03:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 12:03:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:03:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:03:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 12:03:49,098 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:03:49,098 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 12:03:49,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:03:49 BoogieIcfgContainer [2019-09-05 12:03:49,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:03:49,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:03:49,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:03:49,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:03:49,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:03:48" (1/3) ... [2019-09-05 12:03:49,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3897c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:03:49, skipping insertion in model container [2019-09-05 12:03:49,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:03:48" (2/3) ... [2019-09-05 12:03:49,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3897c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:03:49, skipping insertion in model container [2019-09-05 12:03:49,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:03:49" (3/3) ... [2019-09-05 12:03:49,109 INFO L109 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2019-09-05 12:03:49,120 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:03:49,127 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:03:49,158 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:03:49,181 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 12:03:49,181 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:03:49,182 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 12:03:49,182 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:03:49,182 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:03:49,182 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:03:49,182 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:03:49,182 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:03:49,182 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:03:49,198 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-05 12:03:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:03:49,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:49,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:49,205 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:49,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:49,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1448943433, now seen corresponding path program 1 times [2019-09-05 12:03:49,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:49,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:49,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:49,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:49,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:49,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:03:49,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 12:03:49,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 12:03:49,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 12:03:49,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:03:49,357 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-05 12:03:49,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:49,377 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-09-05 12:03:49,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 12:03:49,378 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-05 12:03:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:49,385 INFO L225 Difference]: With dead ends: 41 [2019-09-05 12:03:49,385 INFO L226 Difference]: Without dead ends: 20 [2019-09-05 12:03:49,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:03:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-05 12:03:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-05 12:03:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 12:03:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-05 12:03:49,420 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2019-09-05 12:03:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:49,421 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-05 12:03:49,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 12:03:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-05 12:03:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:03:49,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:49,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:49,423 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:49,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:49,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1815969073, now seen corresponding path program 1 times [2019-09-05 12:03:49,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:49,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:49,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:49,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:49,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:49,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:03:49,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 12:03:49,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:03:49,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:03:49,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:03:49,544 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-09-05 12:03:49,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:49,617 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-05 12:03:49,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:03:49,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-05 12:03:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:49,620 INFO L225 Difference]: With dead ends: 34 [2019-09-05 12:03:49,620 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 12:03:49,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:03:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 12:03:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-05 12:03:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 12:03:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-05 12:03:49,633 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2019-09-05 12:03:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:49,633 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-05 12:03:49,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:03:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-05 12:03:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 12:03:49,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:49,634 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:49,635 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1419508495, now seen corresponding path program 1 times [2019-09-05 12:03:49,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:49,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:49,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:49,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:50,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:50,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:50,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:50,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 12:03:50,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:50,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-05 12:03:50,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:03:50,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:03:50,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:03:50,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-09-05 12:03:50,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-05 12:03:50,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:03:50,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:03:50,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:03:50,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-09-05 12:03:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:50,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:50,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-09-05 12:03:50,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 12:03:50,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 12:03:50,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:03:50,256 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 15 states. [2019-09-05 12:03:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:50,637 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-09-05 12:03:50,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 12:03:50,638 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-09-05 12:03:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:50,640 INFO L225 Difference]: With dead ends: 40 [2019-09-05 12:03:50,640 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 12:03:50,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:03:50,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 12:03:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-09-05 12:03:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 12:03:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-05 12:03:50,665 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2019-09-05 12:03:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:50,665 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-05 12:03:50,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 12:03:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-05 12:03:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 12:03:50,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:50,667 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:50,667 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:50,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:50,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2113189724, now seen corresponding path program 1 times [2019-09-05 12:03:50,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:50,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:50,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:50,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:50,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:50,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:50,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 12:03:50,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:50,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 12:03:50,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:03:50,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:03:50,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 12:03:50,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-09-05 12:03:53,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-05 12:03:53,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:03:53,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:03:53,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:03:53,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-05 12:03:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:03:53,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:53,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2019-09-05 12:03:53,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 12:03:53,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 12:03:53,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=171, Unknown=1, NotChecked=0, Total=210 [2019-09-05 12:03:53,093 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-09-05 12:03:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:56,038 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-09-05 12:03:56,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 12:03:56,039 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-09-05 12:03:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:56,041 INFO L225 Difference]: With dead ends: 42 [2019-09-05 12:03:56,042 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 12:03:56,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=63, Invalid=278, Unknown=1, NotChecked=0, Total=342 [2019-09-05 12:03:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 12:03:56,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-09-05 12:03:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 12:03:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-09-05 12:03:56,051 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2019-09-05 12:03:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:56,051 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-09-05 12:03:56,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 12:03:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-09-05 12:03:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 12:03:56,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:56,053 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:56,053 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:56,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:56,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1564012763, now seen corresponding path program 2 times [2019-09-05 12:03:56,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:56,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:56,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:56,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:03:56,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:56,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:03:56,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:56,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:03:56,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:56,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 12:03:56,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:03:56,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:56,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-05 12:03:56,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 12:03:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 12:03:56,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:03:56,356 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2019-09-05 12:03:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:56,497 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-09-05 12:03:56,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 12:03:56,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-09-05 12:03:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:56,502 INFO L225 Difference]: With dead ends: 60 [2019-09-05 12:03:56,502 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 12:03:56,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:03:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 12:03:56,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-05 12:03:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 12:03:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-05 12:03:56,518 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2019-09-05 12:03:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:56,519 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-05 12:03:56,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 12:03:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-05 12:03:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 12:03:56,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:56,521 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:56,522 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash 119264185, now seen corresponding path program 3 times [2019-09-05 12:03:56,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:56,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:56,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:56,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:03:56,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:56,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:03:56,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:56,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 12:03:56,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:56,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 12:03:56,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:56,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-05 12:03:56,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:03:56,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:03:56,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:03:56,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-09-05 12:03:57,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-05 12:03:57,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:03:57,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:03:57,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:03:57,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-05 12:03:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:03:57,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:57,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-09-05 12:03:57,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 12:03:57,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 12:03:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:03:57,094 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 23 states. [2019-09-05 12:03:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:57,407 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-09-05 12:03:57,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 12:03:57,408 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2019-09-05 12:03:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:57,409 INFO L225 Difference]: With dead ends: 52 [2019-09-05 12:03:57,410 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 12:03:57,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2019-09-05 12:03:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 12:03:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-05 12:03:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 12:03:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-05 12:03:57,419 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 36 [2019-09-05 12:03:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:57,419 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-05 12:03:57,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 12:03:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-05 12:03:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 12:03:57,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:57,421 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:57,421 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash 606836464, now seen corresponding path program 4 times [2019-09-05 12:03:57,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:57,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:57,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:57,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 12:03:57,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:57,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:57,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:03:57,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:03:57,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:57,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 12:03:57,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 12:03:57,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:57,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-09-05 12:03:57,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 12:03:57,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 12:03:57,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-09-05 12:03:57,647 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 16 states. [2019-09-05 12:03:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:57,838 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-09-05 12:03:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 12:03:57,838 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-09-05 12:03:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:57,840 INFO L225 Difference]: With dead ends: 74 [2019-09-05 12:03:57,840 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 12:03:57,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:03:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 12:03:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-05 12:03:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-05 12:03:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-09-05 12:03:57,848 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2019-09-05 12:03:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:57,849 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-09-05 12:03:57,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 12:03:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-09-05 12:03:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 12:03:57,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:57,850 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:57,851 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:57,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:57,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1605303374, now seen corresponding path program 5 times [2019-09-05 12:03:57,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:57,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:57,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:57,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 12:03:58,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:58,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:58,047 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:03:58,094 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-05 12:03:58,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:58,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 12:03:58,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:58,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-05 12:03:58,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:03:58,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:03:58,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:03:58,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-09-05 12:03:58,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-05 12:03:58,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:03:58,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:03:58,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:03:58,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-05 12:03:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 12:03:58,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:58,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-09-05 12:03:58,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 12:03:58,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 12:03:58,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:03:58,592 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 27 states. [2019-09-05 12:03:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:59,125 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-09-05 12:03:59,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:03:59,129 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 46 [2019-09-05 12:03:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:59,130 INFO L225 Difference]: With dead ends: 62 [2019-09-05 12:03:59,130 INFO L226 Difference]: Without dead ends: 60 [2019-09-05 12:03:59,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2019-09-05 12:03:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-05 12:03:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-09-05 12:03:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 12:03:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-05 12:03:59,139 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2019-09-05 12:03:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:59,139 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-05 12:03:59,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 12:03:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-05 12:03:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 12:03:59,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:59,141 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:59,141 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:59,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:59,141 INFO L82 PathProgramCache]: Analyzing trace with hash 921393797, now seen corresponding path program 6 times [2019-09-05 12:03:59,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:59,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:59,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:59,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 27 proven. 29 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 12:03:59,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:59,258 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:59,274 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:03:59,306 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-05 12:03:59,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:59,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 12:03:59,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 12:03:59,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:59,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-09-05 12:03:59,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 12:03:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 12:03:59,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:03:59,424 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2019-09-05 12:03:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:59,618 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2019-09-05 12:03:59,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 12:03:59,619 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-09-05 12:03:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:59,620 INFO L225 Difference]: With dead ends: 88 [2019-09-05 12:03:59,620 INFO L226 Difference]: Without dead ends: 60 [2019-09-05 12:03:59,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:03:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-05 12:03:59,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-05 12:03:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-05 12:03:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-09-05 12:03:59,631 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2019-09-05 12:03:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:59,631 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-09-05 12:03:59,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 12:03:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-09-05 12:03:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 12:03:59,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:59,633 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:59,633 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:59,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:59,633 INFO L82 PathProgramCache]: Analyzing trace with hash 288236131, now seen corresponding path program 7 times [2019-09-05 12:03:59,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:59,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:59,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:59,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 12:03:59,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:59,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:59,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:59,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 12:03:59,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:59,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 12:03:59,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:03:59,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:03:59,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 12:03:59,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-09-05 12:04:33,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-05 12:04:33,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:04:33,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:04:33,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:04:33,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-05 12:04:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 12:04:33,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:33,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2019-09-05 12:04:33,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 12:04:33,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 12:04:33,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=483, Unknown=4, NotChecked=0, Total=552 [2019-09-05 12:04:33,974 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 24 states. [2019-09-05 12:04:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:42,938 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-09-05 12:04:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 12:04:42,939 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2019-09-05 12:04:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:42,940 INFO L225 Difference]: With dead ends: 72 [2019-09-05 12:04:42,941 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 12:04:42,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=90, Invalid=662, Unknown=4, NotChecked=0, Total=756 [2019-09-05 12:04:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 12:04:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-09-05 12:04:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 12:04:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-09-05 12:04:42,951 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2019-09-05 12:04:42,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:42,952 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-09-05 12:04:42,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 12:04:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-09-05 12:04:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 12:04:42,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:42,953 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:42,953 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:42,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:42,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1266785178, now seen corresponding path program 8 times [2019-09-05 12:04:42,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:42,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:42,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:42,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:42,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 12:04:43,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:43,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:43,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:04:43,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:43,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:43,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 12:04:43,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 12:04:43,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:43,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-09-05 12:04:43,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 12:04:43,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 12:04:43,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-09-05 12:04:43,259 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 22 states. [2019-09-05 12:04:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:43,500 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2019-09-05 12:04:43,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 12:04:43,501 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2019-09-05 12:04:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:43,502 INFO L225 Difference]: With dead ends: 102 [2019-09-05 12:04:43,502 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 12:04:43,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:04:43,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 12:04:43,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-05 12:04:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-05 12:04:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-09-05 12:04:43,513 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2019-09-05 12:04:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:43,514 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-09-05 12:04:43,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 12:04:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-09-05 12:04:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 12:04:43,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:43,519 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:43,520 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1601526280, now seen corresponding path program 9 times [2019-09-05 12:04:43,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:43,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:43,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:43,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 86 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 12:04:43,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:43,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:43,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:43,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-05 12:04:43,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:43,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 12:04:43,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:43,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 12:04:43,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:04:43,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:04:43,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:04:43,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-09-05 12:04:45,169 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:04:45,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-09-05 12:04:45,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-05 12:04:45,188 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-09-05 12:04:45,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:04:45,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-09-05 12:04:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 12:04:45,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:45,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2019-09-05 12:04:45,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 12:04:45,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 12:04:45,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:04:45,256 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 37 states. [2019-09-05 12:05:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:01,113 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-09-05 12:05:01,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 12:05:01,114 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 66 [2019-09-05 12:05:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:01,115 INFO L225 Difference]: With dead ends: 114 [2019-09-05 12:05:01,115 INFO L226 Difference]: Without dead ends: 82 [2019-09-05 12:05:01,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=404, Invalid=3756, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:05:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-05 12:05:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-09-05 12:05:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-05 12:05:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-09-05 12:05:01,125 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 66 [2019-09-05 12:05:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:01,126 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-09-05 12:05:01,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 12:05:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-09-05 12:05:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-05 12:05:01,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:01,131 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:01,131 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:01,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:01,135 INFO L82 PathProgramCache]: Analyzing trace with hash 138274573, now seen corresponding path program 10 times [2019-09-05 12:05:01,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:01,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:01,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:01,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:01,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 12:05:01,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:01,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:01,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:05:01,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:05:01,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:01,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 12:05:01,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:01,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 12:05:01,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:05:01,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:05:01,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:05:01,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-09-05 12:05:03,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:05:03,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-09-05 12:05:03,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-05 12:05:03,059 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-09-05 12:05:03,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:05:03,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-09-05 12:05:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 45 proven. 88 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 12:05:03,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:03,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 40 [2019-09-05 12:05:03,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 12:05:03,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 12:05:03,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 12:05:03,139 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-09-05 12:05:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:16,705 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2019-09-05 12:05:16,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 12:05:16,705 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-09-05 12:05:16,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:16,707 INFO L225 Difference]: With dead ends: 124 [2019-09-05 12:05:16,707 INFO L226 Difference]: Without dead ends: 92 [2019-09-05 12:05:16,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 50 SyntacticMatches, 11 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=414, Invalid=4008, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:05:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-05 12:05:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2019-09-05 12:05:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-05 12:05:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-09-05 12:05:16,722 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 76 [2019-09-05 12:05:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:16,722 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-09-05 12:05:16,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 12:05:16,723 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-09-05 12:05:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-05 12:05:16,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:16,724 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:16,724 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:16,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1370929758, now seen corresponding path program 11 times [2019-09-05 12:05:16,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:16,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:16,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:16,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:16,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 14 proven. 162 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 12:05:17,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:17,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:17,107 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:17,159 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-05 12:05:17,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:17,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 12:05:17,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:17,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-05 12:05:17,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:05:17,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:05:17,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:05:17,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-09-05 12:05:18,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-05 12:05:18,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:05:18,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:05:18,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:05:18,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-05 12:05:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 12:05:18,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:18,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2019-09-05 12:05:18,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 12:05:18,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 12:05:18,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1676, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:05:18,545 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 43 states. [2019-09-05 12:05:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:19,646 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2019-09-05 12:05:19,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 12:05:19,646 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 86 [2019-09-05 12:05:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:19,647 INFO L225 Difference]: With dead ends: 102 [2019-09-05 12:05:19,647 INFO L226 Difference]: Without dead ends: 100 [2019-09-05 12:05:19,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 54 SyntacticMatches, 13 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=164, Invalid=2092, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 12:05:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-05 12:05:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-09-05 12:05:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-05 12:05:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-09-05 12:05:19,664 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 86 [2019-09-05 12:05:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:19,666 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-09-05 12:05:19,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 12:05:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-09-05 12:05:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-05 12:05:19,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:19,670 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:19,671 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1973489625, now seen corresponding path program 12 times [2019-09-05 12:05:19,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:19,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:19,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:19,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 115 proven. 93 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-05 12:05:19,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:19,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:19,932 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:19,991 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-05 12:05:19,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:19,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 12:05:19,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 144 proven. 64 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-05 12:05:20,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:20,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2019-09-05 12:05:20,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 12:05:20,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 12:05:20,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:05:20,203 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 31 states. [2019-09-05 12:05:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:20,606 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2019-09-05 12:05:20,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 12:05:20,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2019-09-05 12:05:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:20,610 INFO L225 Difference]: With dead ends: 144 [2019-09-05 12:05:20,610 INFO L226 Difference]: Without dead ends: 100 [2019-09-05 12:05:20,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=374, Invalid=1266, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 12:05:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-05 12:05:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-09-05 12:05:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-05 12:05:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-09-05 12:05:20,621 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2019-09-05 12:05:20,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:20,621 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-09-05 12:05:20,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 12:05:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-09-05 12:05:20,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-05 12:05:20,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:20,623 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:20,623 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:20,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:20,623 INFO L82 PathProgramCache]: Analyzing trace with hash -633986633, now seen corresponding path program 13 times [2019-09-05 12:05:20,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:20,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:20,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:20,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:20,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 16 proven. 209 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-05 12:05:21,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:21,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:05:21,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:21,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 12:05:21,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:21,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 12:05:21,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:05:21,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:05:21,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 12:05:21,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-09-05 12:07:22,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-05 12:07:22,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:07:22,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:07:22,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:07:22,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-05 12:07:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-05 12:07:22,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:22,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2019-09-05 12:07:22,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 12:07:22,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 12:07:22,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1151, Unknown=8, NotChecked=0, Total=1260 [2019-09-05 12:07:22,387 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 36 states. [2019-09-05 12:07:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:38,038 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-09-05 12:07:38,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 12:07:38,039 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 96 [2019-09-05 12:07:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:38,040 INFO L225 Difference]: With dead ends: 112 [2019-09-05 12:07:38,040 INFO L226 Difference]: Without dead ends: 110 [2019-09-05 12:07:38,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 69 SyntacticMatches, 17 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 121.6s TimeCoverageRelationStatistics Valid=126, Invalid=1426, Unknown=8, NotChecked=0, Total=1560 [2019-09-05 12:07:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-05 12:07:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-09-05 12:07:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-05 12:07:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-09-05 12:07:38,051 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 96 [2019-09-05 12:07:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:38,051 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-09-05 12:07:38,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 12:07:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-09-05 12:07:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-05 12:07:38,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:38,053 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:38,053 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:38,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash -292616466, now seen corresponding path program 14 times [2019-09-05 12:07:38,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:38,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:38,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:38,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:38,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 147 proven. 114 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 12:07:38,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:38,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-05 12:07:38,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:07:38,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:07:38,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:38,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 12:07:38,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 180 proven. 81 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 12:07:38,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:38,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2019-09-05 12:07:38,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 12:07:38,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 12:07:38,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 12:07:38,543 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 34 states. [2019-09-05 12:07:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:39,002 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2019-09-05 12:07:39,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 12:07:39,004 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 104 [2019-09-05 12:07:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:39,005 INFO L225 Difference]: With dead ends: 158 [2019-09-05 12:07:39,005 INFO L226 Difference]: Without dead ends: 110 [2019-09-05 12:07:39,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=449, Invalid=1531, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:07:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-05 12:07:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-05 12:07:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-05 12:07:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-09-05 12:07:39,016 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2019-09-05 12:07:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:39,016 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-09-05 12:07:39,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 12:07:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-09-05 12:07:39,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-05 12:07:39,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:39,018 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:39,018 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:39,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1424630964, now seen corresponding path program 15 times [2019-09-05 12:07:39,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:39,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:39,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:39,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:39,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 18 proven. 262 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 12:07:39,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:39,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:07:39,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:39,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-05 12:07:39,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:39,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 12:07:39,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:40,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 12:07:40,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:07:40,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:07:40,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:07:40,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-09-05 12:07:43,054 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:07:43,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-09-05 12:07:43,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-05 12:07:43,067 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-09-05 12:07:43,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:07:43,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-09-05 12:07:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 153 proven. 127 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 12:07:43,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:43,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 53 [2019-09-05 12:07:43,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 12:07:43,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 12:07:43,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2463, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:07:43,183 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 53 states. [2019-09-05 12:07:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:50,873 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2019-09-05 12:07:50,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-05 12:07:50,873 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 106 [2019-09-05 12:07:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:50,874 INFO L225 Difference]: With dead ends: 170 [2019-09-05 12:07:50,875 INFO L226 Difference]: Without dead ends: 122 [2019-09-05 12:07:50,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 64 SyntacticMatches, 17 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=729, Invalid=7281, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 12:07:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-05 12:07:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2019-09-05 12:07:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-05 12:07:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-09-05 12:07:50,888 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 106 [2019-09-05 12:07:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:50,888 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-09-05 12:07:50,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 12:07:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-09-05 12:07:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-05 12:07:50,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:50,890 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:50,890 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:50,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1920871839, now seen corresponding path program 16 times [2019-09-05 12:07:50,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:50,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:50,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:50,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:50,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 20 proven. 321 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-05 12:07:51,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:51,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:51,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:07:51,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:07:51,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:51,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 12:07:51,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:51,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 12:07:51,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:07:51,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:07:51,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 12:07:51,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-09-05 12:09:37,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-05 12:09:37,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:09:37,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:09:37,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:09:37,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-05 12:09:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 341 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-05 12:09:37,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:37,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 42 [2019-09-05 12:09:37,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-05 12:09:37,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-05 12:09:37,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1593, Unknown=10, NotChecked=0, Total=1722 [2019-09-05 12:09:37,758 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 42 states. [2019-09-05 12:09:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:58,384 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2019-09-05 12:09:58,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 12:09:58,385 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 116 [2019-09-05 12:09:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:58,386 INFO L225 Difference]: With dead ends: 132 [2019-09-05 12:09:58,386 INFO L226 Difference]: Without dead ends: 130 [2019-09-05 12:09:58,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 83 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 106.6s TimeCoverageRelationStatistics Valid=144, Invalid=1916, Unknown=10, NotChecked=0, Total=2070 [2019-09-05 12:09:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-05 12:09:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-09-05 12:09:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-05 12:09:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-09-05 12:09:58,397 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 116 [2019-09-05 12:09:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:58,398 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-09-05 12:09:58,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-05 12:09:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-09-05 12:09:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-05 12:09:58,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:58,399 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:58,400 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:58,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:58,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1466143336, now seen corresponding path program 17 times [2019-09-05 12:09:58,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:58,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:58,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:58,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:58,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 223 proven. 162 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-05 12:09:58,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:58,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:58,694 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:09:58,783 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-05 12:09:58,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:58,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 12:09:58,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 264 proven. 121 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-05 12:09:59,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:59,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2019-09-05 12:09:59,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 12:09:59,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 12:09:59,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1204, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 12:09:59,147 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 40 states. [2019-09-05 12:09:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:59,763 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2019-09-05 12:09:59,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 12:09:59,767 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 124 [2019-09-05 12:09:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:59,768 INFO L225 Difference]: With dead ends: 186 [2019-09-05 12:09:59,768 INFO L226 Difference]: Without dead ends: 130 [2019-09-05 12:09:59,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=620, Invalid=2136, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:09:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-05 12:09:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-09-05 12:09:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-05 12:09:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-09-05 12:09:59,781 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2019-09-05 12:09:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:59,781 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-09-05 12:09:59,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 12:09:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-09-05 12:09:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-05 12:09:59,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:59,783 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:59,783 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:59,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:59,783 INFO L82 PathProgramCache]: Analyzing trace with hash 832268022, now seen corresponding path program 18 times [2019-09-05 12:09:59,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:59,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:59,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:59,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:59,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 22 proven. 386 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-05 12:10:00,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:00,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:00,352 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:10:00,497 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 12:10:00,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:00,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 12:10:00,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:00,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 12:10:00,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:10:00,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:10:00,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:10:00,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-09-05 12:10:04,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:10:04,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-09-05 12:10:04,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-05 12:10:04,413 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-09-05 12:10:04,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:10:04,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-09-05 12:10:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 261 proven. 177 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-05 12:10:04,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:04,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 35] total 63 [2019-09-05 12:10:04,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-05 12:10:04,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-05 12:10:04,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=3519, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 12:10:04,573 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 63 states. [2019-09-05 12:10:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:31,576 INFO L93 Difference]: Finished difference Result 222 states and 230 transitions. [2019-09-05 12:10:31,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-05 12:10:31,576 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 126 [2019-09-05 12:10:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:31,578 INFO L225 Difference]: With dead ends: 222 [2019-09-05 12:10:31,578 INFO L226 Difference]: Without dead ends: 142 [2019-09-05 12:10:31,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 74 SyntacticMatches, 21 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4363 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1248, Invalid=16308, Unknown=0, NotChecked=0, Total=17556 [2019-09-05 12:10:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-05 12:10:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2019-09-05 12:10:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-05 12:10:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-09-05 12:10:31,592 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 126 [2019-09-05 12:10:31,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:31,593 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-09-05 12:10:31,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-05 12:10:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-09-05 12:10:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-05 12:10:31,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:31,594 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:31,594 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:31,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash 17561867, now seen corresponding path program 19 times [2019-09-05 12:10:31,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:31,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:31,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:31,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:31,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 24 proven. 457 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-05 12:10:32,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:32,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:32,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:10:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:32,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-05 12:10:32,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:32,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 12:10:32,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:10:32,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:10:32,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 12:10:32,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-09-05 12:13:21,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-05 12:13:21,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:13:21,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:13:21,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:13:21,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-05 12:13:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 0 proven. 481 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-05 12:13:21,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:21,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 48 [2019-09-05 12:13:21,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-05 12:13:21,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-05 12:13:21,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2107, Unknown=12, NotChecked=0, Total=2256 [2019-09-05 12:13:21,912 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 48 states. [2019-09-05 12:13:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:47,491 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2019-09-05 12:13:47,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 12:13:47,494 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 136 [2019-09-05 12:13:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:47,496 INFO L225 Difference]: With dead ends: 152 [2019-09-05 12:13:47,496 INFO L226 Difference]: Without dead ends: 150 [2019-09-05 12:13:47,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 97 SyntacticMatches, 25 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 170.1s TimeCoverageRelationStatistics Valid=162, Invalid=2478, Unknown=12, NotChecked=0, Total=2652 [2019-09-05 12:13:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-05 12:13:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-09-05 12:13:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-05 12:13:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-09-05 12:13:47,509 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 136 [2019-09-05 12:13:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:47,510 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-09-05 12:13:47,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-05 12:13:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-09-05 12:13:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-05 12:13:47,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:47,511 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:47,512 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:47,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:47,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1877849534, now seen corresponding path program 20 times [2019-09-05 12:13:47,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:47,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:47,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:47,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:13:47,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 315 proven. 218 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-05 12:13:47,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:47,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:13:47,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:13:47,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:13:47,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:47,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 12:13:47,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 364 proven. 169 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-05 12:13:48,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:48,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2019-09-05 12:13:48,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 12:13:48,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 12:13:48,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=1600, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 12:13:48,358 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 46 states. [2019-09-05 12:13:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:13:49,151 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2019-09-05 12:13:49,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 12:13:49,151 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 144 [2019-09-05 12:13:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:13:49,152 INFO L225 Difference]: With dead ends: 214 [2019-09-05 12:13:49,152 INFO L226 Difference]: Without dead ends: 150 [2019-09-05 12:13:49,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=819, Invalid=2841, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:13:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-05 12:13:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-09-05 12:13:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-05 12:13:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-09-05 12:13:49,167 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2019-09-05 12:13:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:13:49,167 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-09-05 12:13:49,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 12:13:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-09-05 12:13:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-05 12:13:49,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:13:49,168 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:13:49,169 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:13:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:13:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash 352643232, now seen corresponding path program 21 times [2019-09-05 12:13:49,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:13:49,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:13:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:49,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:13:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:13:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:13:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 26 proven. 534 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-05 12:13:50,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:13:50,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-05 12:13:50,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:13:50,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 12:13:50,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:13:50,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-05 12:13:50,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:13:50,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 12:13:50,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:13:50,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:13:50,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:13:50,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-09-05 12:13:55,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:13:55,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-09-05 12:13:55,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-05 12:13:55,371 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-09-05 12:13:55,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:13:55,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-09-05 12:13:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 325 proven. 235 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-05 12:13:55,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:13:55,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37] total 69 [2019-09-05 12:13:55,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-05 12:13:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-05 12:13:55,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=4213, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:13:55,544 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 69 states. [2019-09-05 12:14:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:13,885 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2019-09-05 12:14:13,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-05 12:14:13,886 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 146 [2019-09-05 12:14:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:13,887 INFO L225 Difference]: With dead ends: 238 [2019-09-05 12:14:13,887 INFO L226 Difference]: Without dead ends: 162 [2019-09-05 12:14:13,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 88 SyntacticMatches, 25 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4035 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1235, Invalid=15795, Unknown=0, NotChecked=0, Total=17030 [2019-09-05 12:14:13,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-05 12:14:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2019-09-05 12:14:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-05 12:14:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-09-05 12:14:13,902 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 146 [2019-09-05 12:14:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:13,903 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-09-05 12:14:13,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-05 12:14:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-09-05 12:14:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-05 12:14:13,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:13,904 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:13,905 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:13,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:13,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1405119051, now seen corresponding path program 22 times [2019-09-05 12:14:13,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:13,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:13,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:13,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:14:13,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 28 proven. 617 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-05 12:14:14,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:14,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:14,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:14:14,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:14:14,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:14:14,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 12:14:14,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:15,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 12:14:15,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:14:15,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:14:15,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:14:15,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-09-05 12:14:20,387 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 12:14:20,389 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:14:20,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2019-09-05 12:14:20,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:14:20,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:14:20,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:14:20,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-09-05 12:14:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 378 proven. 267 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-05 12:14:20,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:20,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39] total 73 [2019-09-05 12:14:20,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-05 12:14:20,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-05 12:14:20,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=4862, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 12:14:20,592 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 73 states. [2019-09-05 12:14:28,418 WARN L188 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-05 12:14:30,514 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-05 12:14:31,773 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-05 12:14:34,005 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-05 12:14:35,797 WARN L188 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-05 12:14:37,897 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-05 12:14:39,995 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-05 12:14:42,100 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-05 12:14:44,196 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-05 12:14:46,292 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-05 12:14:48,390 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-05 12:14:50,486 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-05 12:14:52,581 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-05 12:14:54,635 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-05 12:14:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:14:54,720 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2019-09-05 12:14:54,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-05 12:14:54,720 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 156 [2019-09-05 12:14:54,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:14:54,721 INFO L225 Difference]: With dead ends: 236 [2019-09-05 12:14:54,722 INFO L226 Difference]: Without dead ends: 172 [2019-09-05 12:14:54,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 94 SyntacticMatches, 27 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4757 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=1271, Invalid=18469, Unknown=0, NotChecked=0, Total=19740 [2019-09-05 12:14:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-05 12:14:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2019-09-05 12:14:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-05 12:14:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-09-05 12:14:54,752 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 156 [2019-09-05 12:14:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:14:54,752 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-09-05 12:14:54,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-05 12:14:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-09-05 12:14:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-05 12:14:54,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:14:54,753 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:14:54,753 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:14:54,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:14:54,754 INFO L82 PathProgramCache]: Analyzing trace with hash 553476170, now seen corresponding path program 23 times [2019-09-05 12:14:54,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:14:54,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:14:54,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:54,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:14:54,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:14:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:14:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 30 proven. 706 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-05 12:14:55,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:14:55,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:14:55,668 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:14:56,007 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-09-05 12:14:56,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:14:56,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-05 12:14:56,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:14:56,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-05 12:14:56,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:14:56,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:14:56,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:14:56,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-09-05 12:14:59,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-05 12:14:59,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:14:59,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:14:59,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 12:14:59,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-05 12:14:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-05 12:14:59,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:14:59,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 75 [2019-09-05 12:14:59,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-05 12:14:59,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-05 12:14:59,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=5316, Unknown=0, NotChecked=0, Total=5550 [2019-09-05 12:14:59,558 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 75 states. [2019-09-05 12:15:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:03,597 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2019-09-05 12:15:03,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 12:15:03,597 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 166 [2019-09-05 12:15:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:03,599 INFO L225 Difference]: With dead ends: 182 [2019-09-05 12:15:03,599 INFO L226 Difference]: Without dead ends: 180 [2019-09-05 12:15:03,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 102 SyntacticMatches, 29 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1882 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=268, Invalid=6052, Unknown=0, NotChecked=0, Total=6320 [2019-09-05 12:15:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-05 12:15:03,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2019-09-05 12:15:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-05 12:15:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-09-05 12:15:03,615 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 166 [2019-09-05 12:15:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:03,615 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-09-05 12:15:03,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-05 12:15:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-09-05 12:15:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-05 12:15:03,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:03,617 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:03,617 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:03,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:03,617 INFO L82 PathProgramCache]: Analyzing trace with hash 881066625, now seen corresponding path program 24 times [2019-09-05 12:15:03,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:03,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:03,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:03,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:15:03,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 483 proven. 317 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-05 12:15:04,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:04,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:04,126 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:15:04,488 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-05 12:15:04,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:15:04,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 12:15:04,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 544 proven. 256 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-05 12:15:05,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:15:05,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 55 [2019-09-05 12:15:05,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-05 12:15:05,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-05 12:15:05,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=2299, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:15:05,072 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 55 states. [2019-09-05 12:15:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:15:06,037 INFO L93 Difference]: Finished difference Result 256 states and 274 transitions. [2019-09-05 12:15:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 12:15:06,037 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 174 [2019-09-05 12:15:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:15:06,039 INFO L225 Difference]: With dead ends: 256 [2019-09-05 12:15:06,039 INFO L226 Difference]: Without dead ends: 180 [2019-09-05 12:15:06,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1170, Invalid=4086, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 12:15:06,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-05 12:15:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-05 12:15:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-05 12:15:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-09-05 12:15:06,065 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 174 [2019-09-05 12:15:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:15:06,066 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-09-05 12:15:06,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-05 12:15:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-09-05 12:15:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-05 12:15:06,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:15:06,067 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:15:06,067 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:15:06,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:15:06,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1594337375, now seen corresponding path program 25 times [2019-09-05 12:15:06,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:15:06,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:15:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:06,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:15:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:15:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 32 proven. 801 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-05 12:15:07,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:15:07,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:15:07,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:15:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:15:07,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-05 12:15:07,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:15:07,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-05 12:15:07,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 12:15:07,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 12:15:07,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 12:15:07,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18