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/array-examples/sanfoundry_27_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:28:32,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:28:32,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:28:32,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:28:32,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:28:32,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:28:32,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:28:32,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:28:32,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:28:32,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:28:32,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:28:32,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:28:32,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:28:32,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:28:32,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:28:32,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:28:32,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:28:32,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:28:32,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:28:32,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:28:32,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:28:32,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:28:32,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:28:32,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:28:32,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:28:32,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:28:32,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:28:32,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:28:32,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:28:32,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:28:32,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:28:32,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:28:32,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:28:32,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:28:32,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:28:32,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:28:32,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:28:32,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:28:32,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:28:32,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:28:32,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:28:32,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 22:28:32,391 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:28:32,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:28:32,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:28:32,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:28:32,394 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:28:32,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:28:32,394 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:28:32,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:28:32,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:28:32,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:28:32,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:28:32,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:28:32,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:28:32,397 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:28:32,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:28:32,398 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:28:32,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:28:32,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:28:32,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:28:32,399 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:28:32,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:28:32,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:28:32,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:28:32,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:28:32,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:28:32,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:28:32,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:28:32,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:28:32,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:28:32,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:28:32,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:28:32,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:28:32,479 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:28:32,480 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:28:32,480 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_27_ground.i [2019-10-01 22:28:32,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f17bbc7/d9833888c8eb4a9ca13e0f7ece1ca729/FLAGea1a39d42 [2019-10-01 22:28:33,032 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:28:33,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_27_ground.i [2019-10-01 22:28:33,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f17bbc7/d9833888c8eb4a9ca13e0f7ece1ca729/FLAGea1a39d42 [2019-10-01 22:28:33,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f17bbc7/d9833888c8eb4a9ca13e0f7ece1ca729 [2019-10-01 22:28:33,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:28:33,418 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:28:33,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:28:33,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:28:33,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:28:33,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:28:33" (1/1) ... [2019-10-01 22:28:33,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641eaed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:33, skipping insertion in model container [2019-10-01 22:28:33,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:28:33" (1/1) ... [2019-10-01 22:28:33,436 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:28:33,449 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:28:33,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:28:33,659 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:28:33,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:28:33,796 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:28:33,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:33 WrapperNode [2019-10-01 22:28:33,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:28:33,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:28:33,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:28:33,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:28:33,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:33" (1/1) ... [2019-10-01 22:28:33,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:33" (1/1) ... [2019-10-01 22:28:33,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:33" (1/1) ... [2019-10-01 22:28:33,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:33" (1/1) ... [2019-10-01 22:28:33,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:33" (1/1) ... [2019-10-01 22:28:33,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:33" (1/1) ... [2019-10-01 22:28:33,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:33" (1/1) ... [2019-10-01 22:28:33,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:28:33,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:28:33,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:28:33,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:28:33,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:28:33,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:28:33,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:28:33,907 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:28:33,907 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:28:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:28:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:28:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:28:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:28:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:28:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:28:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:28:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:28:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:28:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:28:34,183 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:28:34,183 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 22:28:34,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:28:34 BoogieIcfgContainer [2019-10-01 22:28:34,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:28:34,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:28:34,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:28:34,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:28:34,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:28:33" (1/3) ... [2019-10-01 22:28:34,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27cfc6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:28:34, skipping insertion in model container [2019-10-01 22:28:34,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:33" (2/3) ... [2019-10-01 22:28:34,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27cfc6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:28:34, skipping insertion in model container [2019-10-01 22:28:34,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:28:34" (3/3) ... [2019-10-01 22:28:34,204 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_27_ground.i [2019-10-01 22:28:34,212 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:28:34,218 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:28:34,235 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:28:34,264 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:28:34,265 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:28:34,265 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:28:34,265 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:28:34,266 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:28:34,266 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:28:34,266 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:28:34,266 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:28:34,266 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:28:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-01 22:28:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 22:28:34,287 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:34,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:34,290 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:34,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:34,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1998025284, now seen corresponding path program 1 times [2019-10-01 22:28:34,297 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:34,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:34,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:34,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:34,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:28:34,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:34,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:28:34,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:28:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:28:34,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:28:34,457 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-10-01 22:28:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:34,481 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2019-10-01 22:28:34,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:28:34,483 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-01 22:28:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:34,491 INFO L225 Difference]: With dead ends: 48 [2019-10-01 22:28:34,491 INFO L226 Difference]: Without dead ends: 23 [2019-10-01 22:28:34,495 INFO L640 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-10-01 22:28:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-01 22:28:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-01 22:28:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-01 22:28:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-10-01 22:28:34,537 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2019-10-01 22:28:34,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:34,538 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-01 22:28:34,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:28:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-10-01 22:28:34,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 22:28:34,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:34,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:34,540 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:34,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:34,540 INFO L82 PathProgramCache]: Analyzing trace with hash -915838997, now seen corresponding path program 1 times [2019-10-01 22:28:34,540 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:34,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:34,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:34,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:34,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:28:34,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:34,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:34,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:34,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:34,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:34,612 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 3 states. [2019-10-01 22:28:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:34,688 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-10-01 22:28:34,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:34,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 22:28:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:34,690 INFO L225 Difference]: With dead ends: 40 [2019-10-01 22:28:34,691 INFO L226 Difference]: Without dead ends: 25 [2019-10-01 22:28:34,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-01 22:28:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-01 22:28:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 22:28:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-01 22:28:34,700 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2019-10-01 22:28:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:34,700 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-01 22:28:34,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-10-01 22:28:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 22:28:34,702 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:34,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:34,703 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:34,704 INFO L82 PathProgramCache]: Analyzing trace with hash 203688137, now seen corresponding path program 1 times [2019-10-01 22:28:34,704 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:34,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:34,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:28:34,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:34,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:34,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:34,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:34,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:34,797 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2019-10-01 22:28:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:34,848 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-10-01 22:28:34,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:34,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-01 22:28:34,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:34,850 INFO L225 Difference]: With dead ends: 38 [2019-10-01 22:28:34,851 INFO L226 Difference]: Without dead ends: 27 [2019-10-01 22:28:34,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-01 22:28:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-10-01 22:28:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-01 22:28:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-01 22:28:34,863 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2019-10-01 22:28:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:34,871 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-01 22:28:34,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-01 22:28:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 22:28:34,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:34,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:34,873 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:34,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:34,876 INFO L82 PathProgramCache]: Analyzing trace with hash -990062782, now seen corresponding path program 1 times [2019-10-01 22:28:34,876 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:34,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:34,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:34,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:34,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:28:34,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:34,965 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:34,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:35,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:28:35,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:28:35,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:35,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:28:35,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:28:35,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:28:35,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:28:35,071 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-10-01 22:28:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:35,137 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-01 22:28:35,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:28:35,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-01 22:28:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:35,141 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:28:35,141 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 22:28:35,143 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:28:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 22:28:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-10-01 22:28:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:28:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-01 22:28:35,152 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2019-10-01 22:28:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:35,153 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-01 22:28:35,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:28:35,154 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-01 22:28:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-01 22:28:35,155 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:35,155 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:35,156 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:35,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:35,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1464200924, now seen corresponding path program 2 times [2019-10-01 22:28:35,156 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:35,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:35,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:35,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:35,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:28:35,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:35,260 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:28:35,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:35,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-01 22:28:35,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:35,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:28:35,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:35,399 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-10-01 22:28:35,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:35,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:35,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:35,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 22:28:35,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 22:28:35,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:28:35,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-10-01 22:28:35,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:28:35,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:28:35,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:35,458 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 11 states. [2019-10-01 22:28:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:35,758 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-10-01 22:28:35,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:28:35,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-10-01 22:28:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:35,761 INFO L225 Difference]: With dead ends: 71 [2019-10-01 22:28:35,762 INFO L226 Difference]: Without dead ends: 55 [2019-10-01 22:28:35,763 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:28:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-01 22:28:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2019-10-01 22:28:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-01 22:28:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-10-01 22:28:35,776 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2019-10-01 22:28:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:35,777 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-10-01 22:28:35,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:28:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-10-01 22:28:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:28:35,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:35,778 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:35,779 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:35,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:35,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1680863843, now seen corresponding path program 1 times [2019-10-01 22:28:35,779 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:35,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:35,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:35,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:35,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 22:28:35,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:35,842 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:28:35,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:35,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:28:35,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 22:28:35,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:35,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 22:28:35,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:28:35,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:28:35,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:28:35,916 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 7 states. [2019-10-01 22:28:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:35,992 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2019-10-01 22:28:35,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:28:35,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-10-01 22:28:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:35,998 INFO L225 Difference]: With dead ends: 88 [2019-10-01 22:28:35,999 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 22:28:36,001 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:28:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 22:28:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2019-10-01 22:28:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 22:28:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-10-01 22:28:36,015 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 27 [2019-10-01 22:28:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:36,015 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-10-01 22:28:36,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:28:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-10-01 22:28:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:28:36,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:36,022 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:36,022 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:36,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash 927761286, now seen corresponding path program 2 times [2019-10-01 22:28:36,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:36,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:36,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:36,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 22:28:36,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:36,117 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:36,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:36,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:36,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:36,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:28:36,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 22:28:36,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:36,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:28:36,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:28:36,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:28:36,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:36,196 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 8 states. [2019-10-01 22:28:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:36,306 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2019-10-01 22:28:36,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:28:36,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-10-01 22:28:36,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:36,309 INFO L225 Difference]: With dead ends: 102 [2019-10-01 22:28:36,309 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 22:28:36,310 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 22:28:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2019-10-01 22:28:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-01 22:28:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-10-01 22:28:36,334 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 32 [2019-10-01 22:28:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:36,334 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-10-01 22:28:36,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:28:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-10-01 22:28:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 22:28:36,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:36,336 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:36,336 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:36,337 INFO L82 PathProgramCache]: Analyzing trace with hash 793377279, now seen corresponding path program 3 times [2019-10-01 22:28:36,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:36,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:36,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:36,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:36,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-01 22:28:36,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:36,469 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:28:36,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:36,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:28:36,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:36,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:28:36,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:36,649 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:36,650 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 32 treesize of output 22 [2019-10-01 22:28:36,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:36,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:36,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:36,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:36,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 22:28:36,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-01 22:28:36,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:28:36,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2019-10-01 22:28:36,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:28:36,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:28:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:28:36,720 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 16 states. [2019-10-01 22:28:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:37,662 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2019-10-01 22:28:37,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 22:28:37,663 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-10-01 22:28:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:37,664 INFO L225 Difference]: With dead ends: 128 [2019-10-01 22:28:37,665 INFO L226 Difference]: Without dead ends: 85 [2019-10-01 22:28:37,666 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=427, Invalid=1465, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:28:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-01 22:28:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-10-01 22:28:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-01 22:28:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-10-01 22:28:37,682 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 37 [2019-10-01 22:28:37,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:37,682 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-10-01 22:28:37,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:28:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-10-01 22:28:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-01 22:28:37,686 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:37,686 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:37,689 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:37,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:37,689 INFO L82 PathProgramCache]: Analyzing trace with hash -924407389, now seen corresponding path program 1 times [2019-10-01 22:28:37,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:37,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:37,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:37,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:37,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-01 22:28:37,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:37,817 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:37,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:37,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:28:37,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-01 22:28:37,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:37,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 22:28:37,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:28:37,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:28:37,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:28:37,901 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 10 states. [2019-10-01 22:28:38,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:38,014 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2019-10-01 22:28:38,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:28:38,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-01 22:28:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:38,018 INFO L225 Difference]: With dead ends: 95 [2019-10-01 22:28:38,018 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 22:28:38,019 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:28:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 22:28:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-10-01 22:28:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-01 22:28:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2019-10-01 22:28:38,028 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 50 [2019-10-01 22:28:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:38,028 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-10-01 22:28:38,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:28:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2019-10-01 22:28:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 22:28:38,030 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:38,030 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:38,030 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:38,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:38,030 INFO L82 PathProgramCache]: Analyzing trace with hash -881740204, now seen corresponding path program 2 times [2019-10-01 22:28:38,031 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:38,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:38,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:38,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:38,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-01 22:28:38,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:38,155 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:38,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:38,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:38,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:38,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:28:38,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:28:38,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:38,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:28:38,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:28:38,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:28:38,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:38,255 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 11 states. [2019-10-01 22:28:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:38,348 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2019-10-01 22:28:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:28:38,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-10-01 22:28:38,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:38,349 INFO L225 Difference]: With dead ends: 103 [2019-10-01 22:28:38,350 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 22:28:38,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:28:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 22:28:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-10-01 22:28:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 22:28:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2019-10-01 22:28:38,369 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 55 [2019-10-01 22:28:38,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:38,371 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2019-10-01 22:28:38,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:28:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2019-10-01 22:28:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-01 22:28:38,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:38,376 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:38,376 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:38,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:38,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1175934471, now seen corresponding path program 3 times [2019-10-01 22:28:38,377 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:38,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:38,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-01 22:28:38,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:38,519 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:38,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:38,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:28:38,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:38,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:28:38,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:38,705 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-10-01 22:28:38,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:38,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:38,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:38,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 22:28:38,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-01 22:28:38,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:38,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2019-10-01 22:28:38,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:28:38,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:28:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:28:38,763 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 22 states. [2019-10-01 22:28:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:39,556 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2019-10-01 22:28:39,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 22:28:39,556 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2019-10-01 22:28:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:39,557 INFO L225 Difference]: With dead ends: 150 [2019-10-01 22:28:39,557 INFO L226 Difference]: Without dead ends: 110 [2019-10-01 22:28:39,559 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=1602, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:28:39,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-01 22:28:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2019-10-01 22:28:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 22:28:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-10-01 22:28:39,572 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 60 [2019-10-01 22:28:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:39,573 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-10-01 22:28:39,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:28:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-10-01 22:28:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 22:28:39,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:39,575 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:39,576 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash 486565358, now seen corresponding path program 1 times [2019-10-01 22:28:39,576 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:39,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:39,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:39,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:39,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-01 22:28:39,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:39,683 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:39,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:39,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:28:39,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:28:39,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:39,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 22:28:39,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:28:39,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:28:39,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:28:39,771 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 13 states. [2019-10-01 22:28:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:39,870 INFO L93 Difference]: Finished difference Result 186 states and 228 transitions. [2019-10-01 22:28:39,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 22:28:39,871 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-10-01 22:28:39,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:39,872 INFO L225 Difference]: With dead ends: 186 [2019-10-01 22:28:39,872 INFO L226 Difference]: Without dead ends: 112 [2019-10-01 22:28:39,873 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:28:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-01 22:28:39,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2019-10-01 22:28:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 22:28:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2019-10-01 22:28:39,884 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 65 [2019-10-01 22:28:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:39,885 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2019-10-01 22:28:39,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:28:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2019-10-01 22:28:39,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 22:28:39,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:39,886 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:39,886 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:39,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:39,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1479059049, now seen corresponding path program 2 times [2019-10-01 22:28:39,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:39,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:39,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:39,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:39,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-01 22:28:40,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:40,006 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:40,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:40,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:40,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:40,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:28:40,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-01 22:28:40,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:40,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 22:28:40,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:28:40,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:28:40,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:28:40,130 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand 14 states. [2019-10-01 22:28:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:40,257 INFO L93 Difference]: Finished difference Result 200 states and 246 transitions. [2019-10-01 22:28:40,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:28:40,258 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-10-01 22:28:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:40,260 INFO L225 Difference]: With dead ends: 200 [2019-10-01 22:28:40,260 INFO L226 Difference]: Without dead ends: 120 [2019-10-01 22:28:40,261 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:28:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-01 22:28:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2019-10-01 22:28:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 22:28:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2019-10-01 22:28:40,282 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 70 [2019-10-01 22:28:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:40,283 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2019-10-01 22:28:40,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:28:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2019-10-01 22:28:40,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 22:28:40,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:40,285 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:40,286 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:40,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:40,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1554600330, now seen corresponding path program 3 times [2019-10-01 22:28:40,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:40,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:40,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:40,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:40,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 2 proven. 121 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-01 22:28:40,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:40,456 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:40,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:40,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:28:40,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:40,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:28:40,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:40,779 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:40,780 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 32 treesize of output 22 [2019-10-01 22:28:40,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:40,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:40,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:40,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:40,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 22:28:40,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-10-01 22:28:40,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:40,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-10-01 22:28:40,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:28:40,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:28:40,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:28:40,856 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand 28 states. [2019-10-01 22:28:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:43,619 INFO L93 Difference]: Finished difference Result 238 states and 288 transitions. [2019-10-01 22:28:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-01 22:28:43,621 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2019-10-01 22:28:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:43,623 INFO L225 Difference]: With dead ends: 238 [2019-10-01 22:28:43,623 INFO L226 Difference]: Without dead ends: 152 [2019-10-01 22:28:43,627 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2151 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1467, Invalid=5673, Unknown=0, NotChecked=0, Total=7140 [2019-10-01 22:28:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-01 22:28:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 91. [2019-10-01 22:28:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-01 22:28:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-10-01 22:28:43,636 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 75 [2019-10-01 22:28:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:43,636 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-10-01 22:28:43,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:28:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-10-01 22:28:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-01 22:28:43,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:43,638 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:43,638 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:43,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:43,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1566010490, now seen corresponding path program 4 times [2019-10-01 22:28:43,639 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:43,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:43,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:43,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 4 proven. 144 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-01 22:28:43,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:43,788 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:43,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:28:43,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:28:43,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:43,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:28:43,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 22:28:43,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:43,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 22:28:43,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:28:43,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:28:43,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:28:43,895 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 16 states. [2019-10-01 22:28:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:44,012 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2019-10-01 22:28:44,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:28:44,012 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-10-01 22:28:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:44,014 INFO L225 Difference]: With dead ends: 159 [2019-10-01 22:28:44,014 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 22:28:44,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:28:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 22:28:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-10-01 22:28:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-01 22:28:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2019-10-01 22:28:44,028 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 88 [2019-10-01 22:28:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:44,028 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2019-10-01 22:28:44,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:28:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2019-10-01 22:28:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-01 22:28:44,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:44,030 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:44,030 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:44,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:44,030 INFO L82 PathProgramCache]: Analyzing trace with hash 32199903, now seen corresponding path program 5 times [2019-10-01 22:28:44,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:44,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:44,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:44,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 4 proven. 169 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-01 22:28:44,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:44,206 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:44,243 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:28:44,383 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-10-01 22:28:44,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:44,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:28:44,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-10-01 22:28:44,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:44,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 16 [2019-10-01 22:28:44,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:28:44,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:28:44,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:28:44,405 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand 16 states. [2019-10-01 22:28:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:44,525 INFO L93 Difference]: Finished difference Result 167 states and 198 transitions. [2019-10-01 22:28:44,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:28:44,525 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2019-10-01 22:28:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:44,527 INFO L225 Difference]: With dead ends: 167 [2019-10-01 22:28:44,527 INFO L226 Difference]: Without dead ends: 104 [2019-10-01 22:28:44,528 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:28:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-01 22:28:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-10-01 22:28:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-01 22:28:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-10-01 22:28:44,536 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 93 [2019-10-01 22:28:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:44,537 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-10-01 22:28:44,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:28:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-10-01 22:28:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 22:28:44,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:44,538 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:44,538 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:44,538 INFO L82 PathProgramCache]: Analyzing trace with hash 639925226, now seen corresponding path program 6 times [2019-10-01 22:28:44,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:44,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:44,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:44,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 4 proven. 196 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-10-01 22:28:44,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:44,687 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:44,724 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:28:44,812 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 22:28:44,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:44,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:28:44,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:44,975 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-10-01 22:28:44,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:44,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:44,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:44,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 22:28:44,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-10-01 22:28:45,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:45,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2019-10-01 22:28:45,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:28:45,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:28:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:28:45,046 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 30 states. [2019-10-01 22:28:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:46,256 INFO L93 Difference]: Finished difference Result 233 states and 284 transitions. [2019-10-01 22:28:46,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 22:28:46,256 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 98 [2019-10-01 22:28:46,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:46,258 INFO L225 Difference]: With dead ends: 233 [2019-10-01 22:28:46,258 INFO L226 Difference]: Without dead ends: 167 [2019-10-01 22:28:46,261 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=821, Invalid=3211, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:28:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-01 22:28:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 156. [2019-10-01 22:28:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-01 22:28:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 186 transitions. [2019-10-01 22:28:46,277 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 186 transitions. Word has length 98 [2019-10-01 22:28:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:46,279 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 186 transitions. [2019-10-01 22:28:46,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:28:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 186 transitions. [2019-10-01 22:28:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-01 22:28:46,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:46,281 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:46,281 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:46,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:46,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1961194887, now seen corresponding path program 4 times [2019-10-01 22:28:46,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:46,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:46,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:46,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:46,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 4 proven. 225 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-10-01 22:28:46,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:46,512 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:46,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:28:46,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:28:46,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:46,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:28:46,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-10-01 22:28:46,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:46,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:28:46,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:28:46,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:28:46,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:28:46,629 INFO L87 Difference]: Start difference. First operand 156 states and 186 transitions. Second operand 19 states. [2019-10-01 22:28:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:46,793 INFO L93 Difference]: Finished difference Result 288 states and 354 transitions. [2019-10-01 22:28:46,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:28:46,793 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 103 [2019-10-01 22:28:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:46,795 INFO L225 Difference]: With dead ends: 288 [2019-10-01 22:28:46,795 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 22:28:46,796 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:28:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 22:28:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2019-10-01 22:28:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-01 22:28:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2019-10-01 22:28:46,809 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 103 [2019-10-01 22:28:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:46,809 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2019-10-01 22:28:46,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:28:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2019-10-01 22:28:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 22:28:46,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:46,811 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:46,811 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:46,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash -644683188, now seen corresponding path program 5 times [2019-10-01 22:28:46,811 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:46,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:46,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:46,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:46,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 4 proven. 256 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-01 22:28:46,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:46,992 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:47,021 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:28:47,275 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 22:28:47,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:47,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:28:47,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-10-01 22:28:47,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:47,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:28:47,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:28:47,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:28:47,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:28:47,327 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand 20 states. [2019-10-01 22:28:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:47,473 INFO L93 Difference]: Finished difference Result 302 states and 372 transitions. [2019-10-01 22:28:47,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:28:47,474 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-01 22:28:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:47,475 INFO L225 Difference]: With dead ends: 302 [2019-10-01 22:28:47,475 INFO L226 Difference]: Without dead ends: 177 [2019-10-01 22:28:47,476 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:28:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-01 22:28:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2019-10-01 22:28:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-01 22:28:47,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2019-10-01 22:28:47,489 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 108 [2019-10-01 22:28:47,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:47,490 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2019-10-01 22:28:47,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:28:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2019-10-01 22:28:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-01 22:28:47,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:47,491 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:47,492 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:47,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1773279765, now seen corresponding path program 6 times [2019-10-01 22:28:47,492 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:47,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:47,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:47,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 4 proven. 289 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-10-01 22:28:47,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:47,728 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:47,765 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:28:47,884 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 22:28:47,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:47,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 22:28:47,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:48,332 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:48,332 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 32 treesize of output 22 [2019-10-01 22:28:48,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:48,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:48,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:48,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:48,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 22:28:48,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 44 proven. 87 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Stream Closed [2019-10-01 22:28:48,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:48,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2019-10-01 22:28:48,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:28:48,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:28:48,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=982, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:28:48,603 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand 36 states. [2019-10-01 22:28:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:52,371 INFO L93 Difference]: Finished difference Result 344 states and 417 transitions. [2019-10-01 22:28:52,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-10-01 22:28:52,371 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 113 [2019-10-01 22:28:52,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:52,373 INFO L225 Difference]: With dead ends: 344 [2019-10-01 22:28:52,373 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 22:28:52,379 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4549 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2963, Invalid=10843, Unknown=0, NotChecked=0, Total=13806 [2019-10-01 22:28:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 22:28:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 129. [2019-10-01 22:28:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-01 22:28:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-10-01 22:28:52,391 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 113 [2019-10-01 22:28:52,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:52,392 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-10-01 22:28:52,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:28:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-10-01 22:28:52,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 22:28:52,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:52,394 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:52,394 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:52,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:52,394 INFO L82 PathProgramCache]: Analyzing trace with hash -110502295, now seen corresponding path program 7 times [2019-10-01 22:28:52,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:52,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:52,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:52,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:52,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 6 proven. 324 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2019-10-01 22:28:52,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:52,666 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:52,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:52,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:28:52,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2019-10-01 22:28:52,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:52,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 22:28:52,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:28:52,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:28:52,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:28:52,809 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 22 states. [2019-10-01 22:28:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:52,981 INFO L93 Difference]: Finished difference Result 223 states and 264 transitions. [2019-10-01 22:28:52,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:28:52,981 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 126 [2019-10-01 22:28:52,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:52,983 INFO L225 Difference]: With dead ends: 223 [2019-10-01 22:28:52,983 INFO L226 Difference]: Without dead ends: 137 [2019-10-01 22:28:52,983 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:28:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-01 22:28:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2019-10-01 22:28:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-01 22:28:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2019-10-01 22:28:52,993 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 126 [2019-10-01 22:28:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:52,993 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2019-10-01 22:28:52,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:28:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2019-10-01 22:28:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-01 22:28:52,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:52,994 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:52,995 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:52,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:52,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1997593494, now seen corresponding path program 8 times [2019-10-01 22:28:52,995 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:52,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:52,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:52,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:52,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 6 proven. 361 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2019-10-01 22:28:53,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:53,254 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:53,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:53,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:53,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:53,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:28:53,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-10-01 22:28:53,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:53,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 22:28:53,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:28:53,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:28:53,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:28:53,419 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand 23 states. [2019-10-01 22:28:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:53,611 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2019-10-01 22:28:53,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:28:53,612 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 131 [2019-10-01 22:28:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:53,613 INFO L225 Difference]: With dead ends: 231 [2019-10-01 22:28:53,613 INFO L226 Difference]: Without dead ends: 142 [2019-10-01 22:28:53,614 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:28:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-01 22:28:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2019-10-01 22:28:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 22:28:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2019-10-01 22:28:53,624 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 131 [2019-10-01 22:28:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:53,625 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2019-10-01 22:28:53,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:28:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2019-10-01 22:28:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-01 22:28:53,626 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:53,626 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:53,626 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:53,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:53,627 INFO L82 PathProgramCache]: Analyzing trace with hash 387007181, now seen corresponding path program 9 times [2019-10-01 22:28:53,627 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:53,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:53,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:53,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:53,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 6 proven. 400 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-10-01 22:28:53,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:53,941 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:53,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:54,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:28:54,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:54,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:28:54,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:54,254 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-10-01 22:28:54,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:54,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:54,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:54,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 22:28:54,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 11 proven. 159 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2019-10-01 22:28:54,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:54,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 38 [2019-10-01 22:28:54,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:28:54,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:28:54,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1052, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:28:54,346 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand 38 states. [2019-10-01 22:28:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:56,307 INFO L93 Difference]: Finished difference Result 316 states and 385 transitions. [2019-10-01 22:28:56,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 22:28:56,307 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 136 [2019-10-01 22:28:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:56,311 INFO L225 Difference]: With dead ends: 316 [2019-10-01 22:28:56,311 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 22:28:56,314 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1618 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1446, Invalid=5360, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 22:28:56,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 22:28:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 213. [2019-10-01 22:28:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-01 22:28:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 255 transitions. [2019-10-01 22:28:56,335 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 255 transitions. Word has length 136 [2019-10-01 22:28:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:56,335 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 255 transitions. [2019-10-01 22:28:56,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:28:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 255 transitions. [2019-10-01 22:28:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-01 22:28:56,337 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:56,337 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 19, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:56,338 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:56,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:56,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1675845628, now seen corresponding path program 7 times [2019-10-01 22:28:56,338 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:56,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:56,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:56,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:56,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 6 proven. 441 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2019-10-01 22:28:56,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:56,668 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:56,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:56,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:28:56,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:56,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2019-10-01 22:28:56,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:56,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 22:28:56,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 22:28:56,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 22:28:56,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:28:56,816 INFO L87 Difference]: Start difference. First operand 213 states and 255 transitions. Second operand 25 states. [2019-10-01 22:28:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:57,049 INFO L93 Difference]: Finished difference Result 390 states and 480 transitions. [2019-10-01 22:28:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:28:57,049 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 141 [2019-10-01 22:28:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:57,051 INFO L225 Difference]: With dead ends: 390 [2019-10-01 22:28:57,052 INFO L226 Difference]: Without dead ends: 226 [2019-10-01 22:28:57,053 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:28:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-01 22:28:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2019-10-01 22:28:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-01 22:28:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 265 transitions. [2019-10-01 22:28:57,071 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 265 transitions. Word has length 141 [2019-10-01 22:28:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:57,071 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 265 transitions. [2019-10-01 22:28:57,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 22:28:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 265 transitions. [2019-10-01 22:28:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 22:28:57,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:57,073 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 20, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:57,074 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash 528158511, now seen corresponding path program 8 times [2019-10-01 22:28:57,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:57,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:57,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 6 proven. 484 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2019-10-01 22:28:57,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:57,394 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:57,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:57,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:57,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:57,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:28:57,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-10-01 22:28:57,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:57,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:28:57,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:28:57,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:28:57,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:28:57,520 INFO L87 Difference]: Start difference. First operand 221 states and 265 transitions. Second operand 26 states. [2019-10-01 22:28:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:57,713 INFO L93 Difference]: Finished difference Result 404 states and 498 transitions. [2019-10-01 22:28:57,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:28:57,714 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 146 [2019-10-01 22:28:57,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:57,715 INFO L225 Difference]: With dead ends: 404 [2019-10-01 22:28:57,715 INFO L226 Difference]: Without dead ends: 234 [2019-10-01 22:28:57,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:28:57,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-01 22:28:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 229. [2019-10-01 22:28:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-01 22:28:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 275 transitions. [2019-10-01 22:28:57,735 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 275 transitions. Word has length 146 [2019-10-01 22:28:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:57,735 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 275 transitions. [2019-10-01 22:28:57,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:28:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 275 transitions. [2019-10-01 22:28:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-01 22:28:57,737 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:57,737 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 21, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:57,737 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:57,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash 709006240, now seen corresponding path program 9 times [2019-10-01 22:28:57,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:57,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:57,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:57,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 6 proven. 529 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-01 22:28:58,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:58,081 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:58,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:58,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:28:58,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:58,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 22:28:58,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:58,788 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:58,788 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 32 treesize of output 22 [2019-10-01 22:28:58,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:58,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:58,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:58,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:58,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 22:28:58,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 62 proven. 188 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:28:58,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:58,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 44 [2019-10-01 22:28:58,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 22:28:58,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 22:28:58,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:28:58,963 INFO L87 Difference]: Start difference. First operand 229 states and 275 transitions. Second operand 44 states. [2019-10-01 22:29:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:05,975 INFO L93 Difference]: Finished difference Result 450 states and 546 transitions. [2019-10-01 22:29:05,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-10-01 22:29:05,975 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 151 [2019-10-01 22:29:05,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:05,977 INFO L225 Difference]: With dead ends: 450 [2019-10-01 22:29:05,977 INFO L226 Difference]: Without dead ends: 274 [2019-10-01 22:29:05,982 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7845 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4991, Invalid=17659, Unknown=0, NotChecked=0, Total=22650 [2019-10-01 22:29:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-01 22:29:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 167. [2019-10-01 22:29:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 22:29:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 192 transitions. [2019-10-01 22:29:05,996 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 192 transitions. Word has length 151 [2019-10-01 22:29:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:05,996 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 192 transitions. [2019-10-01 22:29:05,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 22:29:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2019-10-01 22:29:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-01 22:29:05,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:05,997 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:05,998 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:05,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:05,998 INFO L82 PathProgramCache]: Analyzing trace with hash 52054604, now seen corresponding path program 10 times [2019-10-01 22:29:05,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:05,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:05,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:06,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:06,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 8 proven. 576 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2019-10-01 22:29:06,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:06,348 INFO L224 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-10-01 22:29:06,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:06,459 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:06,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:06,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:29:06,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2019-10-01 22:29:06,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:06,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 22:29:06,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:29:06,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:29:06,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:29:06,505 INFO L87 Difference]: Start difference. First operand 167 states and 192 transitions. Second operand 28 states. [2019-10-01 22:29:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:06,760 INFO L93 Difference]: Finished difference Result 287 states and 340 transitions. [2019-10-01 22:29:06,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:29:06,760 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 164 [2019-10-01 22:29:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:06,786 INFO L225 Difference]: With dead ends: 287 [2019-10-01 22:29:06,787 INFO L226 Difference]: Without dead ends: 175 [2019-10-01 22:29:06,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:29:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-01 22:29:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2019-10-01 22:29:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-01 22:29:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 198 transitions. [2019-10-01 22:29:06,807 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 198 transitions. Word has length 164 [2019-10-01 22:29:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:06,808 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 198 transitions. [2019-10-01 22:29:06,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:29:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 198 transitions. [2019-10-01 22:29:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-01 22:29:06,810 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:06,811 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:06,811 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash 173761781, now seen corresponding path program 11 times [2019-10-01 22:29:06,813 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:06,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:06,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:06,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:06,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 8 proven. 625 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2019-10-01 22:29:07,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:07,386 INFO L224 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-10-01 22:29:07,438 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:13,586 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-10-01 22:29:13,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:13,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:29:13,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-01 22:29:13,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:13,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 28 [2019-10-01 22:29:13,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:29:13,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:29:13,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:29:13,630 INFO L87 Difference]: Start difference. First operand 172 states and 198 transitions. Second operand 28 states. [2019-10-01 22:29:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:13,849 INFO L93 Difference]: Finished difference Result 295 states and 350 transitions. [2019-10-01 22:29:13,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:29:13,851 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 169 [2019-10-01 22:29:13,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:13,852 INFO L225 Difference]: With dead ends: 295 [2019-10-01 22:29:13,852 INFO L226 Difference]: Without dead ends: 180 [2019-10-01 22:29:13,853 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:29:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-01 22:29:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2019-10-01 22:29:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-01 22:29:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2019-10-01 22:29:13,865 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 169 [2019-10-01 22:29:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:13,865 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2019-10-01 22:29:13,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 22:29:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2019-10-01 22:29:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 22:29:13,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:13,867 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:13,867 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:13,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:13,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1519217328, now seen corresponding path program 12 times [2019-10-01 22:29:13,868 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:13,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:13,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:13,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:13,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 8 proven. 676 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2019-10-01 22:29:14,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:14,474 INFO L224 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-10-01 22:29:14,573 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:15,827 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 22:29:15,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:15,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 22:29:15,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:16,167 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-10-01 22:29:16,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:29:16,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:29:16,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:29:16,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 22:29:16,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1665 backedges. 16 proven. 286 refuted. 0 times theorem prover too weak. 1363 trivial. 0 not checked. [2019-10-01 22:29:16,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:16,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19] total 46 [2019-10-01 22:29:16,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 22:29:16,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 22:29:16,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=1515, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:29:16,334 INFO L87 Difference]: Start difference. First operand 177 states and 204 transitions. Second operand 46 states. [2019-10-01 22:29:18,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:18,798 INFO L93 Difference]: Finished difference Result 399 states and 486 transitions. [2019-10-01 22:29:18,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-01 22:29:18,798 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 174 [2019-10-01 22:29:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:18,801 INFO L225 Difference]: With dead ends: 399 [2019-10-01 22:29:18,801 INFO L226 Difference]: Without dead ends: 281 [2019-10-01 22:29:18,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2502 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2253, Invalid=8049, Unknown=0, NotChecked=0, Total=10302 [2019-10-01 22:29:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-01 22:29:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 270. [2019-10-01 22:29:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-10-01 22:29:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 324 transitions. [2019-10-01 22:29:18,824 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 324 transitions. Word has length 174 [2019-10-01 22:29:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:18,825 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 324 transitions. [2019-10-01 22:29:18,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 22:29:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 324 transitions. [2019-10-01 22:29:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-01 22:29:18,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:18,827 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 25, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:18,827 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:18,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:18,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1780803215, now seen corresponding path program 10 times [2019-10-01 22:29:18,828 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:18,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:18,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:18,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:18,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1794 backedges. 8 proven. 729 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2019-10-01 22:29:19,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:19,579 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:19,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:19,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:19,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:19,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:29:19,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1794 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1065 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:29:19,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:19,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 22:29:19,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:29:19,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:29:19,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:29:19,751 INFO L87 Difference]: Start difference. First operand 270 states and 324 transitions. Second operand 31 states. [2019-10-01 22:29:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:20,024 INFO L93 Difference]: Finished difference Result 492 states and 606 transitions. [2019-10-01 22:29:20,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:29:20,024 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 179 [2019-10-01 22:29:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:20,026 INFO L225 Difference]: With dead ends: 492 [2019-10-01 22:29:20,026 INFO L226 Difference]: Without dead ends: 283 [2019-10-01 22:29:20,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:29:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-01 22:29:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 278. [2019-10-01 22:29:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-01 22:29:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 334 transitions. [2019-10-01 22:29:20,059 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 334 transitions. Word has length 179 [2019-10-01 22:29:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:20,060 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 334 transitions. [2019-10-01 22:29:20,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:29:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 334 transitions. [2019-10-01 22:29:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-01 22:29:20,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:20,061 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 26, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:20,061 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:20,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1521429230, now seen corresponding path program 11 times [2019-10-01 22:29:20,061 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:20,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:20,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1928 backedges. 8 proven. 784 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2019-10-01 22:29:20,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:20,485 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:20,543 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:22,756 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 22:29:22,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:22,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:29:22,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1928 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2019-10-01 22:29:22,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:22,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 31 [2019-10-01 22:29:22,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:29:22,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:29:22,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:29:22,796 INFO L87 Difference]: Start difference. First operand 278 states and 334 transitions. Second operand 31 states. [2019-10-01 22:29:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:23,057 INFO L93 Difference]: Finished difference Result 506 states and 624 transitions. [2019-10-01 22:29:23,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 22:29:23,058 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 184 [2019-10-01 22:29:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:23,059 INFO L225 Difference]: With dead ends: 506 [2019-10-01 22:29:23,059 INFO L226 Difference]: Without dead ends: 291 [2019-10-01 22:29:23,060 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:29:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-10-01 22:29:23,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 286. [2019-10-01 22:29:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-01 22:29:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 344 transitions. [2019-10-01 22:29:23,082 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 344 transitions. Word has length 184 [2019-10-01 22:29:23,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:23,082 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 344 transitions. [2019-10-01 22:29:23,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:29:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 344 transitions. [2019-10-01 22:29:23,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-01 22:29:23,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:23,084 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 27, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:23,084 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:23,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:23,085 INFO L82 PathProgramCache]: Analyzing trace with hash -88539605, now seen corresponding path program 12 times [2019-10-01 22:29:23,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:23,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:23,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:23,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:23,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2067 backedges. 8 proven. 841 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2019-10-01 22:29:23,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:23,540 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:23,598 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:24,412 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 22:29:24,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:24,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 22:29:24,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:25,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:29:25,367 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 32 treesize of output 22 [2019-10-01 22:29:25,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:25,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:29:25,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:29:25,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:29:25,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 22:29:25,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2067 backedges. 80 proven. 326 refuted. 0 times theorem prover too weak. 1661 trivial. 0 not checked. [2019-10-01 22:29:25,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:25,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 22] total 52 [2019-10-01 22:29:25,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-01 22:29:25,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-01 22:29:25,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=1973, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 22:29:25,640 INFO L87 Difference]: Start difference. First operand 286 states and 344 transitions. Second operand 52 states. [2019-10-01 22:29:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:33,064 INFO L93 Difference]: Finished difference Result 556 states and 675 transitions. [2019-10-01 22:29:33,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-01 22:29:33,064 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 189 [2019-10-01 22:29:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:33,067 INFO L225 Difference]: With dead ends: 556 [2019-10-01 22:29:33,067 INFO L226 Difference]: Without dead ends: 335 [2019-10-01 22:29:33,071 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 163 SyntacticMatches, 7 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12039 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=7551, Invalid=26121, Unknown=0, NotChecked=0, Total=33672 [2019-10-01 22:29:33,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-10-01 22:29:33,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 205. [2019-10-01 22:29:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-01 22:29:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 236 transitions. [2019-10-01 22:29:33,087 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 236 transitions. Word has length 189 [2019-10-01 22:29:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:33,088 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 236 transitions. [2019-10-01 22:29:33,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-01 22:29:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 236 transitions. [2019-10-01 22:29:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 22:29:33,089 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:33,089 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:33,090 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:33,090 INFO L82 PathProgramCache]: Analyzing trace with hash 824809263, now seen corresponding path program 13 times [2019-10-01 22:29:33,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:33,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:33,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:33,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:33,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 10 proven. 900 refuted. 0 times theorem prover too weak. 1337 trivial. 0 not checked. [2019-10-01 22:29:33,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:33,549 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:33,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:33,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 22:29:33,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1347 trivial. 0 not checked. [2019-10-01 22:29:33,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:33,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 22:29:33,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:29:33,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:29:33,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:29:33,771 INFO L87 Difference]: Start difference. First operand 205 states and 236 transitions. Second operand 34 states. [2019-10-01 22:29:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:34,036 INFO L93 Difference]: Finished difference Result 351 states and 416 transitions. [2019-10-01 22:29:34,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 22:29:34,038 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 202 [2019-10-01 22:29:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:34,039 INFO L225 Difference]: With dead ends: 351 [2019-10-01 22:29:34,039 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 22:29:34,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:29:34,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 22:29:34,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2019-10-01 22:29:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-01 22:29:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 242 transitions. [2019-10-01 22:29:34,056 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 242 transitions. Word has length 202 [2019-10-01 22:29:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:34,056 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 242 transitions. [2019-10-01 22:29:34,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:29:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 242 transitions. [2019-10-01 22:29:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-01 22:29:34,058 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:34,058 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:34,058 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:34,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1802611072, now seen corresponding path program 14 times [2019-10-01 22:29:34,059 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:34,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:34,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:34,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:34,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 10 proven. 961 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2019-10-01 22:29:34,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:34,878 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:34,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:35,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:35,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:35,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:29:35,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1435 trivial. 0 not checked. [2019-10-01 22:29:35,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:35,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 22:29:35,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:29:35,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:29:35,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:29:35,076 INFO L87 Difference]: Start difference. First operand 210 states and 242 transitions. Second operand 35 states. [2019-10-01 22:29:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:35,382 INFO L93 Difference]: Finished difference Result 359 states and 426 transitions. [2019-10-01 22:29:35,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:29:35,382 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 207 [2019-10-01 22:29:35,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:35,383 INFO L225 Difference]: With dead ends: 359 [2019-10-01 22:29:35,383 INFO L226 Difference]: Without dead ends: 218 [2019-10-01 22:29:35,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:29:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-01 22:29:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2019-10-01 22:29:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-01 22:29:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2019-10-01 22:29:35,399 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 207 [2019-10-01 22:29:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:35,399 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2019-10-01 22:29:35,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:29:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2019-10-01 22:29:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-01 22:29:35,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:35,401 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:35,401 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:35,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:35,402 INFO L82 PathProgramCache]: Analyzing trace with hash 298365843, now seen corresponding path program 15 times [2019-10-01 22:29:35,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:35,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:35,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:35,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:35,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 10 proven. 1024 refuted. 0 times theorem prover too weak. 1516 trivial. 0 not checked. [2019-10-01 22:29:35,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:35,998 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:36,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:29:36,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 22:29:36,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:36,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:29:36,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:36,611 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-10-01 22:29:36,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:29:36,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:29:36,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:29:36,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 22:29:36,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 21 proven. 450 refuted. 0 times theorem prover too weak. 2079 trivial. 0 not checked. [2019-10-01 22:29:36,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:36,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 21] total 54 [2019-10-01 22:29:36,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:29:36,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:29:36,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=803, Invalid=2059, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:29:36,758 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand 54 states. [2019-10-01 22:29:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:40,106 INFO L93 Difference]: Finished difference Result 482 states and 587 transitions. [2019-10-01 22:29:40,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-01 22:29:40,107 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 212 [2019-10-01 22:29:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:40,109 INFO L225 Difference]: With dead ends: 482 [2019-10-01 22:29:40,109 INFO L226 Difference]: Without dead ends: 338 [2019-10-01 22:29:40,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3579 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3242, Invalid=11278, Unknown=0, NotChecked=0, Total=14520 [2019-10-01 22:29:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-01 22:29:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 327. [2019-10-01 22:29:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-10-01 22:29:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 393 transitions. [2019-10-01 22:29:40,139 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 393 transitions. Word has length 212 [2019-10-01 22:29:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:40,140 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 393 transitions. [2019-10-01 22:29:40,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:29:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 393 transitions. [2019-10-01 22:29:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-01 22:29:40,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:40,142 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 31, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:40,143 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:40,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:40,143 INFO L82 PathProgramCache]: Analyzing trace with hash -808346086, now seen corresponding path program 13 times [2019-10-01 22:29:40,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:40,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:40,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:40,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:40,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 10 proven. 1089 refuted. 0 times theorem prover too weak. 1610 trivial. 0 not checked. [2019-10-01 22:29:40,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:40,755 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:40,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:40,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 22:29:40,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:29:40,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:40,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 22:29:40,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 22:29:40,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 22:29:40,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:29:40,967 INFO L87 Difference]: Start difference. First operand 327 states and 393 transitions. Second operand 37 states. [2019-10-01 22:29:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:41,274 INFO L93 Difference]: Finished difference Result 594 states and 732 transitions. [2019-10-01 22:29:41,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 22:29:41,274 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 217 [2019-10-01 22:29:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:41,276 INFO L225 Difference]: With dead ends: 594 [2019-10-01 22:29:41,276 INFO L226 Difference]: Without dead ends: 340 [2019-10-01 22:29:41,277 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:29:41,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-10-01 22:29:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 335. [2019-10-01 22:29:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-10-01 22:29:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 403 transitions. [2019-10-01 22:29:41,311 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 403 transitions. Word has length 217 [2019-10-01 22:29:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:41,312 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 403 transitions. [2019-10-01 22:29:41,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 22:29:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 403 transitions. [2019-10-01 22:29:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-01 22:29:41,314 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:41,314 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 32, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:41,314 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:41,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:41,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1778646005, now seen corresponding path program 14 times [2019-10-01 22:29:41,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:41,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:41,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:41,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:41,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 10 proven. 1156 refuted. 0 times theorem prover too weak. 1707 trivial. 0 not checked. [2019-10-01 22:29:41,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:41,909 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:41,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:42,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:42,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:42,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 22:29:42,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [2019-10-01 22:29:42,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:42,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 22:29:42,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:29:42,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:29:42,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:29:42,171 INFO L87 Difference]: Start difference. First operand 335 states and 403 transitions. Second operand 38 states. [2019-10-01 22:29:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:42,485 INFO L93 Difference]: Finished difference Result 608 states and 750 transitions. [2019-10-01 22:29:42,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 22:29:42,486 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 222 [2019-10-01 22:29:42,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:42,487 INFO L225 Difference]: With dead ends: 608 [2019-10-01 22:29:42,487 INFO L226 Difference]: Without dead ends: 348 [2019-10-01 22:29:42,488 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:29:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-10-01 22:29:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 343. [2019-10-01 22:29:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-01 22:29:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 413 transitions. [2019-10-01 22:29:42,519 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 413 transitions. Word has length 222 [2019-10-01 22:29:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:42,521 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 413 transitions. [2019-10-01 22:29:42,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:29:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 413 transitions. [2019-10-01 22:29:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-01 22:29:42,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:42,524 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 33, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:42,524 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:42,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1408473526, now seen corresponding path program 15 times [2019-10-01 22:29:42,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:42,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:42,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 10 proven. 1225 refuted. 0 times theorem prover too weak. 1807 trivial. 0 not checked. [2019-10-01 22:29:43,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:43,123 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:43,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:29:43,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 22:29:43,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:43,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 22:29:43,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:44,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:29:44,371 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 32 treesize of output 22 [2019-10-01 22:29:44,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:44,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:29:44,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:29:44,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:29:44,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 22:29:44,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 98 proven. 501 refuted. 0 times theorem prover too weak. 2443 trivial. 0 not checked. [2019-10-01 22:29:44,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:44,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 24] total 60 [2019-10-01 22:29:44,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 22:29:44,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 22:29:44,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=950, Invalid=2590, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:29:44,575 INFO L87 Difference]: Start difference. First operand 343 states and 413 transitions. Second operand 60 states. [2019-10-01 22:30:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:03,865 INFO L93 Difference]: Finished difference Result 662 states and 804 transitions. [2019-10-01 22:30:03,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-10-01 22:30:03,866 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 227 [2019-10-01 22:30:03,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:03,869 INFO L225 Difference]: With dead ends: 662 [2019-10-01 22:30:03,869 INFO L226 Difference]: Without dead ends: 396 [2019-10-01 22:30:03,873 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 210 SyntacticMatches, 9 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17131 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10643, Invalid=36229, Unknown=0, NotChecked=0, Total=46872 [2019-10-01 22:30:03,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-10-01 22:30:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 243. [2019-10-01 22:30:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-10-01 22:30:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 280 transitions. [2019-10-01 22:30:03,894 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 280 transitions. Word has length 227 [2019-10-01 22:30:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:03,894 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 280 transitions. [2019-10-01 22:30:03,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 22:30:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 280 transitions. [2019-10-01 22:30:03,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-01 22:30:03,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:03,896 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:03,897 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:03,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:03,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1668840174, now seen corresponding path program 16 times [2019-10-01 22:30:03,897 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:03,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:03,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:03,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:03,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3260 backedges. 12 proven. 1296 refuted. 0 times theorem prover too weak. 1952 trivial. 0 not checked. [2019-10-01 22:30:04,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:04,597 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:04,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:30:04,783 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:30:04,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:04,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 22:30:04,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3260 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1964 trivial. 0 not checked. [2019-10-01 22:30:04,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:04,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-10-01 22:30:04,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 22:30:04,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 22:30:04,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:30:04,840 INFO L87 Difference]: Start difference. First operand 243 states and 280 transitions. Second operand 40 states. [2019-10-01 22:30:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:05,184 INFO L93 Difference]: Finished difference Result 415 states and 492 transitions. [2019-10-01 22:30:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 22:30:05,186 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 240 [2019-10-01 22:30:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:05,187 INFO L225 Difference]: With dead ends: 415 [2019-10-01 22:30:05,187 INFO L226 Difference]: Without dead ends: 251 [2019-10-01 22:30:05,188 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:30:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-01 22:30:05,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2019-10-01 22:30:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-01 22:30:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 286 transitions. [2019-10-01 22:30:05,206 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 286 transitions. Word has length 240 [2019-10-01 22:30:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:05,206 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 286 transitions. [2019-10-01 22:30:05,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 22:30:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2019-10-01 22:30:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-01 22:30:05,208 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:05,208 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:05,208 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:05,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:05,209 INFO L82 PathProgramCache]: Analyzing trace with hash 778451211, now seen corresponding path program 17 times [2019-10-01 22:30:05,209 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:05,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:05,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:05,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:05,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3439 backedges. 12 proven. 1369 refuted. 0 times theorem prover too weak. 2058 trivial. 0 not checked. [2019-10-01 22:30:06,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:06,170 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:06,260 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:30:15,729 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-10-01 22:30:15,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:15,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 22:30:15,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3439 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2019-10-01 22:30:15,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:15,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 22:30:15,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:30:15,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:30:15,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:30:15,807 INFO L87 Difference]: Start difference. First operand 248 states and 286 transitions. Second operand 41 states. [2019-10-01 22:30:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:16,268 INFO L93 Difference]: Finished difference Result 423 states and 502 transitions. [2019-10-01 22:30:16,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:30:16,269 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 245 [2019-10-01 22:30:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:16,272 INFO L225 Difference]: With dead ends: 423 [2019-10-01 22:30:16,272 INFO L226 Difference]: Without dead ends: 256 [2019-10-01 22:30:16,273 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:30:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-01 22:30:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2019-10-01 22:30:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-01 22:30:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 292 transitions. [2019-10-01 22:30:16,290 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 292 transitions. Word has length 245 [2019-10-01 22:30:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:16,290 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 292 transitions. [2019-10-01 22:30:16,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:30:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 292 transitions. [2019-10-01 22:30:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 22:30:16,291 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:16,291 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:16,291 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:16,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1452089994, now seen corresponding path program 18 times [2019-10-01 22:30:16,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:16,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:16,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3623 backedges. 12 proven. 1444 refuted. 0 times theorem prover too weak. 2167 trivial. 0 not checked. [2019-10-01 22:30:17,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:17,355 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:17,451 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:30:37,024 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 22:30:37,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:37,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 22:30:37,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:37,525 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-10-01 22:30:37,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:30:37,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:30:37,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-10-01 22:30:37,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 22:30:37,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:30:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3623 backedges. 26 proven. 651 refuted. 0 times theorem prover too weak. 2946 trivial. 0 not checked. [2019-10-01 22:30:37,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:37,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 23] total 62 [2019-10-01 22:30:37,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 22:30:37,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 22:30:37,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1098, Invalid=2684, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:30:37,718 INFO L87 Difference]: Start difference. First operand 253 states and 292 transitions. Second operand 62 states. [2019-10-01 22:30:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:42,048 INFO L93 Difference]: Finished difference Result 565 states and 688 transitions. [2019-10-01 22:30:42,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-10-01 22:30:42,048 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 250 [2019-10-01 22:30:42,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:42,050 INFO L225 Difference]: With dead ends: 565 [2019-10-01 22:30:42,051 INFO L226 Difference]: Without dead ends: 395 [2019-10-01 22:30:42,052 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4846 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4413, Invalid=15047, Unknown=0, NotChecked=0, Total=19460 [2019-10-01 22:30:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-01 22:30:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 384. [2019-10-01 22:30:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-10-01 22:30:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 462 transitions. [2019-10-01 22:30:42,089 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 462 transitions. Word has length 250 [2019-10-01 22:30:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:42,089 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 462 transitions. [2019-10-01 22:30:42,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 22:30:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 462 transitions. [2019-10-01 22:30:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-01 22:30:42,093 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:42,093 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 37, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:42,093 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:42,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:42,094 INFO L82 PathProgramCache]: Analyzing trace with hash -62847323, now seen corresponding path program 16 times [2019-10-01 22:30:42,094 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:42,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:42,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:42,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:42,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3812 backedges. 12 proven. 1521 refuted. 0 times theorem prover too weak. 2279 trivial. 0 not checked. [2019-10-01 22:30:42,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:42,889 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:43,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:30:43,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:30:43,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:43,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 22:30:43,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3812 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 2291 trivial. 0 not checked. [2019-10-01 22:30:43,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:43,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-01 22:30:43,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:30:43,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:30:43,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:30:43,178 INFO L87 Difference]: Start difference. First operand 384 states and 462 transitions. Second operand 43 states. [2019-10-01 22:30:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:43,574 INFO L93 Difference]: Finished difference Result 696 states and 858 transitions. [2019-10-01 22:30:43,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 22:30:43,575 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 255 [2019-10-01 22:30:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:43,576 INFO L225 Difference]: With dead ends: 696 [2019-10-01 22:30:43,576 INFO L226 Difference]: Without dead ends: 397 [2019-10-01 22:30:43,578 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:30:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-10-01 22:30:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 392. [2019-10-01 22:30:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-10-01 22:30:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 472 transitions. [2019-10-01 22:30:43,609 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 472 transitions. Word has length 255 [2019-10-01 22:30:43,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:43,610 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 472 transitions. [2019-10-01 22:30:43,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:30:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 472 transitions. [2019-10-01 22:30:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-01 22:30:43,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:43,612 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 38, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:43,613 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1543783384, now seen corresponding path program 17 times [2019-10-01 22:30:43,613 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:43,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:43,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:43,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:43,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4006 backedges. 12 proven. 1600 refuted. 0 times theorem prover too weak. 2394 trivial. 0 not checked. [2019-10-01 22:30:44,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:44,368 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:44,469 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:30:54,424 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-10-01 22:30:54,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:54,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 22:30:54,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4006 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:30:54,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:54,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42] total 43 [2019-10-01 22:30:54,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:30:54,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:30:54,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:30:54,507 INFO L87 Difference]: Start difference. First operand 392 states and 472 transitions. Second operand 43 states. [2019-10-01 22:30:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:54,806 INFO L93 Difference]: Finished difference Result 710 states and 876 transitions. [2019-10-01 22:30:54,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:30:54,806 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 260 [2019-10-01 22:30:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:54,807 INFO L225 Difference]: With dead ends: 710 [2019-10-01 22:30:54,808 INFO L226 Difference]: Without dead ends: 405 [2019-10-01 22:30:54,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:30:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-10-01 22:30:54,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 400. [2019-10-01 22:30:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-10-01 22:30:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 482 transitions. [2019-10-01 22:30:54,854 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 482 transitions. Word has length 260 [2019-10-01 22:30:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:54,854 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 482 transitions. [2019-10-01 22:30:54,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:30:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 482 transitions. [2019-10-01 22:30:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-01 22:30:54,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:54,857 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 39, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:54,858 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1599120961, now seen corresponding path program 18 times [2019-10-01 22:30:54,858 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:54,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:54,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:54,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:54,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4205 backedges. 12 proven. 1681 refuted. 0 times theorem prover too weak. 2512 trivial. 0 not checked. [2019-10-01 22:30:55,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:55,657 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:55,756 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:31:01,190 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 22:31:01,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:01,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 22:31:01,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:02,529 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:31:02,530 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 32 treesize of output 22 [2019-10-01 22:31:02,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:31:02,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:31:02,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:31:02,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:31:02,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 22:31:02,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:31:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4205 backedges. 116 proven. 713 refuted. 0 times theorem prover too weak. 3376 trivial. 0 not checked. [2019-10-01 22:31:02,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:02,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 26] total 68 [2019-10-01 22:31:02,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 22:31:02,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 22:31:02,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1268, Invalid=3288, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:31:02,794 INFO L87 Difference]: Start difference. First operand 400 states and 482 transitions. Second operand 68 states. [2019-10-01 22:31:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:16,107 INFO L93 Difference]: Finished difference Result 768 states and 933 transitions. [2019-10-01 22:31:16,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2019-10-01 22:31:16,111 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 265 [2019-10-01 22:31:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:16,112 INFO L225 Difference]: With dead ends: 768 [2019-10-01 22:31:16,112 INFO L226 Difference]: Without dead ends: 457 [2019-10-01 22:31:16,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 233 SyntacticMatches, 11 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23121 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14267, Invalid=47983, Unknown=0, NotChecked=0, Total=62250 [2019-10-01 22:31:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-10-01 22:31:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 281. [2019-10-01 22:31:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-01 22:31:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 324 transitions. [2019-10-01 22:31:16,139 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 324 transitions. Word has length 265 [2019-10-01 22:31:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:16,140 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 324 transitions. [2019-10-01 22:31:16,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 22:31:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 324 transitions. [2019-10-01 22:31:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-01 22:31:16,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:16,142 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:16,142 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:16,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1906562037, now seen corresponding path program 19 times [2019-10-01 22:31:16,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:16,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:16,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:16,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:16,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4461 backedges. 14 proven. 1764 refuted. 0 times theorem prover too weak. 2683 trivial. 0 not checked. [2019-10-01 22:31:17,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:17,513 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:17,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:31:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:17,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 22:31:17,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4461 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 2697 trivial. 0 not checked. [2019-10-01 22:31:17,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:17,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-10-01 22:31:17,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 22:31:17,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 22:31:17,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:31:17,779 INFO L87 Difference]: Start difference. First operand 281 states and 324 transitions. Second operand 46 states. [2019-10-01 22:31:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:18,248 INFO L93 Difference]: Finished difference Result 479 states and 568 transitions. [2019-10-01 22:31:18,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 22:31:18,248 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 278 [2019-10-01 22:31:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:18,249 INFO L225 Difference]: With dead ends: 479 [2019-10-01 22:31:18,249 INFO L226 Difference]: Without dead ends: 289 [2019-10-01 22:31:18,250 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:31:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-01 22:31:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-10-01 22:31:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-01 22:31:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 330 transitions. [2019-10-01 22:31:18,273 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 330 transitions. Word has length 278 [2019-10-01 22:31:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:18,273 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 330 transitions. [2019-10-01 22:31:18,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 22:31:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 330 transitions. [2019-10-01 22:31:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-01 22:31:18,275 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:18,276 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:18,276 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1799441558, now seen corresponding path program 20 times [2019-10-01 22:31:18,276 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:18,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:18,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:18,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:31:18,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4670 backedges. 14 proven. 1849 refuted. 0 times theorem prover too weak. 2807 trivial. 0 not checked. [2019-10-01 22:31:19,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:19,164 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:19,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:31:19,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:31:19,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:19,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 22:31:19,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4670 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2821 trivial. 0 not checked. [2019-10-01 22:31:19,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:19,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 22:31:19,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 22:31:19,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 22:31:19,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:31:19,461 INFO L87 Difference]: Start difference. First operand 286 states and 330 transitions. Second operand 47 states. [2019-10-01 22:31:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:19,815 INFO L93 Difference]: Finished difference Result 487 states and 578 transitions. [2019-10-01 22:31:19,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:31:19,822 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 283 [2019-10-01 22:31:19,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:19,824 INFO L225 Difference]: With dead ends: 487 [2019-10-01 22:31:19,824 INFO L226 Difference]: Without dead ends: 294 [2019-10-01 22:31:19,825 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:31:19,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-01 22:31:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-10-01 22:31:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-10-01 22:31:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 336 transitions. [2019-10-01 22:31:19,847 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 336 transitions. Word has length 283 [2019-10-01 22:31:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:19,847 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 336 transitions. [2019-10-01 22:31:19,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 22:31:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 336 transitions. [2019-10-01 22:31:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-01 22:31:19,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:19,850 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:19,850 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:19,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:19,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1169926233, now seen corresponding path program 21 times [2019-10-01 22:31:19,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:19,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:19,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:19,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:19,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4884 backedges. 14 proven. 1936 refuted. 0 times theorem prover too weak. 2934 trivial. 0 not checked. [2019-10-01 22:31:21,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:21,153 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:21,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:31:22,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-10-01 22:31:22,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:22,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:31:22,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:22,814 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-10-01 22:31:22,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:31:22,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:31:22,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:31:22,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 22:31:22,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:31:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4884 backedges. 31 proven. 889 refuted. 0 times theorem prover too weak. 3964 trivial. 0 not checked. [2019-10-01 22:31:23,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:23,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25] total 70 [2019-10-01 22:31:23,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 22:31:23,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 22:31:23,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1440, Invalid=3390, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:31:23,055 INFO L87 Difference]: Start difference. First operand 291 states and 336 transitions. Second operand 70 states. [2019-10-01 22:31:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:28,551 INFO L93 Difference]: Finished difference Result 648 states and 789 transitions. [2019-10-01 22:31:28,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-10-01 22:31:28,552 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 288 [2019-10-01 22:31:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:28,554 INFO L225 Difference]: With dead ends: 648 [2019-10-01 22:31:28,555 INFO L226 Difference]: Without dead ends: 452 [2019-10-01 22:31:28,556 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6304 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5766, Invalid=19356, Unknown=0, NotChecked=0, Total=25122 [2019-10-01 22:31:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-01 22:31:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 441. [2019-10-01 22:31:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-01 22:31:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 531 transitions. [2019-10-01 22:31:28,601 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 531 transitions. Word has length 288 [2019-10-01 22:31:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:28,601 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 531 transitions. [2019-10-01 22:31:28,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 22:31:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 531 transitions. [2019-10-01 22:31:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-01 22:31:28,636 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:28,636 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 43, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:28,637 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:28,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash 118579248, now seen corresponding path program 19 times [2019-10-01 22:31:28,637 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:28,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:28,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:28,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:28,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5103 backedges. 14 proven. 2025 refuted. 0 times theorem prover too weak. 3064 trivial. 0 not checked. [2019-10-01 22:31:29,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:29,679 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:29,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:31:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:29,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 22:31:29,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5103 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (46)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:31:29,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:29,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-01 22:31:30,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 22:31:30,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 22:31:30,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:31:30,001 INFO L87 Difference]: Start difference. First operand 441 states and 531 transitions. Second operand 49 states. [2019-10-01 22:31:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:30,786 INFO L93 Difference]: Finished difference Result 798 states and 984 transitions. [2019-10-01 22:31:30,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 22:31:30,786 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 293 [2019-10-01 22:31:30,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:30,789 INFO L225 Difference]: With dead ends: 798 [2019-10-01 22:31:30,789 INFO L226 Difference]: Without dead ends: 454 [2019-10-01 22:31:30,791 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:31:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-10-01 22:31:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 449. [2019-10-01 22:31:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-01 22:31:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 541 transitions. [2019-10-01 22:31:30,836 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 541 transitions. Word has length 293 [2019-10-01 22:31:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:30,836 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 541 transitions. [2019-10-01 22:31:30,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 22:31:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 541 transitions. [2019-10-01 22:31:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-01 22:31:30,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:30,839 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 44, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:30,839 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:30,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:30,839 INFO L82 PathProgramCache]: Analyzing trace with hash -985568069, now seen corresponding path program 20 times [2019-10-01 22:31:30,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:30,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:30,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:30,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:31:30,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5327 backedges. 14 proven. 2116 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2019-10-01 22:31:31,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:31,903 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:32,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:31:32,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:31:32,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:32,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 22:31:32,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5327 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3211 trivial. 0 not checked. [2019-10-01 22:31:32,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:32,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-01 22:31:32,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 22:31:32,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 22:31:32,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:31:32,190 INFO L87 Difference]: Start difference. First operand 449 states and 541 transitions. Second operand 50 states. [2019-10-01 22:31:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:32,594 INFO L93 Difference]: Finished difference Result 812 states and 1002 transitions. [2019-10-01 22:31:32,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 22:31:32,595 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 298 [2019-10-01 22:31:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:32,597 INFO L225 Difference]: With dead ends: 812 [2019-10-01 22:31:32,597 INFO L226 Difference]: Without dead ends: 462 [2019-10-01 22:31:32,598 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:31:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-10-01 22:31:32,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 457. [2019-10-01 22:31:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-10-01 22:31:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 551 transitions. [2019-10-01 22:31:32,641 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 551 transitions. Word has length 298 [2019-10-01 22:31:32,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:32,641 INFO L475 AbstractCegarLoop]: Abstraction has 457 states and 551 transitions. [2019-10-01 22:31:32,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 22:31:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 551 transitions. [2019-10-01 22:31:32,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-01 22:31:32,644 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:32,644 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 45, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:32,644 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:32,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:32,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1968282676, now seen corresponding path program 21 times [2019-10-01 22:31:32,645 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:32,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:32,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:32,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:32,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 14 proven. 2209 refuted. 0 times theorem prover too weak. 3333 trivial. 0 not checked. [2019-10-01 22:31:33,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:33,686 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:33,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:31:34,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-10-01 22:31:34,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:34,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 22:31:34,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:36,057 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:31:36,057 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 32 treesize of output 22 [2019-10-01 22:31:36,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:31:36,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:31:36,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:31:36,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:31:36,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 22:31:36,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:31:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 134 proven. 962 refuted. 0 times theorem prover too weak. 4460 trivial. 0 not checked. [2019-10-01 22:31:36,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:36,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 28] total 76 [2019-10-01 22:31:36,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-01 22:31:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-01 22:31:36,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1633, Invalid=4067, Unknown=0, NotChecked=0, Total=5700 [2019-10-01 22:31:36,364 INFO L87 Difference]: Start difference. First operand 457 states and 551 transitions. Second operand 76 states. [2019-10-01 22:31:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:58,119 INFO L93 Difference]: Finished difference Result 874 states and 1062 transitions. [2019-10-01 22:31:58,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2019-10-01 22:31:58,120 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 303 [2019-10-01 22:31:58,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:58,122 INFO L225 Difference]: With dead ends: 874 [2019-10-01 22:31:58,122 INFO L226 Difference]: Without dead ends: 518 [2019-10-01 22:31:58,126 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 282 SyntacticMatches, 13 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30009 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18423, Invalid=61383, Unknown=0, NotChecked=0, Total=79806 [2019-10-01 22:31:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-10-01 22:31:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 319. [2019-10-01 22:31:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-01 22:31:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 368 transitions. [2019-10-01 22:31:58,153 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 368 transitions. Word has length 303 [2019-10-01 22:31:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:58,154 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 368 transitions. [2019-10-01 22:31:58,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-01 22:31:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 368 transitions. [2019-10-01 22:31:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-01 22:31:58,156 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:58,156 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:58,156 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1550730200, now seen corresponding path program 22 times [2019-10-01 22:31:58,157 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:58,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:58,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:58,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:58,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5850 backedges. 16 proven. 2304 refuted. 0 times theorem prover too weak. 3530 trivial. 0 not checked. [2019-10-01 22:31:59,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:59,348 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:59,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:31:59,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:31:59,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:59,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-01 22:31:59,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5850 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 3546 trivial. 0 not checked. [2019-10-01 22:31:59,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:59,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-10-01 22:31:59,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-01 22:31:59,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-01 22:31:59,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 22:31:59,662 INFO L87 Difference]: Start difference. First operand 319 states and 368 transitions. Second operand 52 states. [2019-10-01 22:32:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:32:00,102 INFO L93 Difference]: Finished difference Result 543 states and 644 transitions. [2019-10-01 22:32:00,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 22:32:00,103 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 316 [2019-10-01 22:32:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:32:00,104 INFO L225 Difference]: With dead ends: 543 [2019-10-01 22:32:00,105 INFO L226 Difference]: Without dead ends: 327 [2019-10-01 22:32:00,106 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 22:32:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-01 22:32:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 324. [2019-10-01 22:32:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-10-01 22:32:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 374 transitions. [2019-10-01 22:32:00,129 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 374 transitions. Word has length 316 [2019-10-01 22:32:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:32:00,130 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 374 transitions. [2019-10-01 22:32:00,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-01 22:32:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 374 transitions. [2019-10-01 22:32:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-10-01 22:32:00,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:32:00,132 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:32:00,133 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:32:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:32:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash -16920287, now seen corresponding path program 23 times [2019-10-01 22:32:00,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:32:00,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:32:00,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:00,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:32:00,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6089 backedges. 16 proven. 2401 refuted. 0 times theorem prover too weak. 3672 trivial. 0 not checked. [2019-10-01 22:32:01,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:32:01,394 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:32:01,536 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:32:34,488 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2019-10-01 22:32:34,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:32:34,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 22:32:34,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:32:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6089 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 3688 trivial. 0 not checked. [2019-10-01 22:32:34,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:32:34,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-01 22:32:34,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 22:32:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 22:32:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:32:34,591 INFO L87 Difference]: Start difference. First operand 324 states and 374 transitions. Second operand 53 states. [2019-10-01 22:32:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:32:35,029 INFO L93 Difference]: Finished difference Result 551 states and 654 transitions. [2019-10-01 22:32:35,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 22:32:35,030 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 321 [2019-10-01 22:32:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:32:35,031 INFO L225 Difference]: With dead ends: 551 [2019-10-01 22:32:35,032 INFO L226 Difference]: Without dead ends: 332 [2019-10-01 22:32:35,033 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:32:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-01 22:32:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2019-10-01 22:32:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-01 22:32:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 380 transitions. [2019-10-01 22:32:35,060 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 380 transitions. Word has length 321 [2019-10-01 22:32:35,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:32:35,061 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 380 transitions. [2019-10-01 22:32:35,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 22:32:35,061 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 380 transitions. [2019-10-01 22:32:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-01 22:32:35,063 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:32:35,063 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:32:35,064 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:32:35,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:32:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash 777180220, now seen corresponding path program 24 times [2019-10-01 22:32:35,064 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:32:35,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:32:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:35,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:32:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6333 backedges. 16 proven. 2500 refuted. 0 times theorem prover too weak. 3817 trivial. 0 not checked. [2019-10-01 22:32:36,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:32:36,351 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:32:36,495 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:33:23,818 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2019-10-01 22:33:23,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:23,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-01 22:33:23,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:24,518 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-10-01 22:33:24,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:33:24,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:33:24,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:33:24,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 22:33:24,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6333 backedges. 36 proven. 1164 refuted. 0 times theorem prover too weak. 5133 trivial. 0 not checked. [2019-10-01 22:33:24,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:24,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 27] total 78 [2019-10-01 22:33:24,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-10-01 22:33:24,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-10-01 22:33:24,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1829, Invalid=4177, Unknown=0, NotChecked=0, Total=6006 [2019-10-01 22:33:24,828 INFO L87 Difference]: Start difference. First operand 329 states and 380 transitions. Second operand 78 states. [2019-10-01 22:33:30,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:30,704 INFO L93 Difference]: Finished difference Result 731 states and 890 transitions. [2019-10-01 22:33:30,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-10-01 22:33:30,705 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 326 [2019-10-01 22:33:30,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:30,707 INFO L225 Difference]: With dead ends: 731 [2019-10-01 22:33:30,707 INFO L226 Difference]: Without dead ends: 509 [2019-10-01 22:33:30,709 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7952 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7301, Invalid=24205, Unknown=0, NotChecked=0, Total=31506 [2019-10-01 22:33:30,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-10-01 22:33:30,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 498. [2019-10-01 22:33:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-10-01 22:33:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 600 transitions. [2019-10-01 22:33:30,748 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 600 transitions. Word has length 326 [2019-10-01 22:33:30,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:30,749 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 600 transitions. [2019-10-01 22:33:30,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-10-01 22:33:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 600 transitions. [2019-10-01 22:33:30,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-01 22:33:30,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:30,752 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 49, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:30,752 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:30,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:30,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2074023237, now seen corresponding path program 22 times [2019-10-01 22:33:30,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:30,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:30,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:30,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:30,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 16 proven. 2601 refuted. 0 times theorem prover too weak. 3965 trivial. 0 not checked. [2019-10-01 22:33:31,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:31,916 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:33:32,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:33:32,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:33:32,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:32,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 22:33:32,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6582 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 3981 trivial. 0 not checked. [2019-10-01 22:33:32,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:32,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-01 22:33:32,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 22:33:32,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 22:33:32,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:33:32,254 INFO L87 Difference]: Start difference. First operand 498 states and 600 transitions. Second operand 55 states. [2019-10-01 22:33:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:32,802 INFO L93 Difference]: Finished difference Result 900 states and 1110 transitions. [2019-10-01 22:33:32,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 22:33:32,802 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 331 [2019-10-01 22:33:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:32,804 INFO L225 Difference]: With dead ends: 900 [2019-10-01 22:33:32,804 INFO L226 Difference]: Without dead ends: 511 [2019-10-01 22:33:32,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:33:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-01 22:33:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 506. [2019-10-01 22:33:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-01 22:33:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 610 transitions. [2019-10-01 22:33:32,840 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 610 transitions. Word has length 331 [2019-10-01 22:33:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:32,840 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 610 transitions. [2019-10-01 22:33:32,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 22:33:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 610 transitions. [2019-10-01 22:33:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-01 22:33:32,843 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:32,843 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 50, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:32,844 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:32,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:32,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1221904738, now seen corresponding path program 23 times [2019-10-01 22:33:32,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:32,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:32,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:32,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:32,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6836 backedges. 16 proven. 2704 refuted. 0 times theorem prover too weak. 4116 trivial. 0 not checked. [2019-10-01 22:33:34,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:34,052 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:33:34,198 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:34:01,980 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-10-01 22:34:01,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:34:02,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 22:34:02,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:34:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6836 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 2960 trivial. 0 not checked. [2019-10-01 22:34:02,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:34:02,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 55 [2019-10-01 22:34:02,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 22:34:02,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 22:34:02,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:34:02,102 INFO L87 Difference]: Start difference. First operand 506 states and 610 transitions. Second operand 55 states. [2019-10-01 22:34:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:34:02,497 INFO L93 Difference]: Finished difference Result 914 states and 1128 transitions. [2019-10-01 22:34:02,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 22:34:02,498 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 336 [2019-10-01 22:34:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:34:02,499 INFO L225 Difference]: With dead ends: 914 [2019-10-01 22:34:02,499 INFO L226 Difference]: Without dead ends: 519 [2019-10-01 22:34:02,500 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:34:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-10-01 22:34:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 514. [2019-10-01 22:34:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-10-01 22:34:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 620 transitions. [2019-10-01 22:34:02,534 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 620 transitions. Word has length 336 [2019-10-01 22:34:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:34:02,534 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 620 transitions. [2019-10-01 22:34:02,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 22:34:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 620 transitions. [2019-10-01 22:34:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-10-01 22:34:02,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:34:02,537 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 51, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:34:02,537 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:34:02,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:34:02,538 INFO L82 PathProgramCache]: Analyzing trace with hash 476779095, now seen corresponding path program 24 times [2019-10-01 22:34:02,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:34:02,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:34:02,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:02,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:34:02,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:34:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7095 backedges. 16 proven. 2809 refuted. 0 times theorem prover too weak. 4270 trivial. 0 not checked. [2019-10-01 22:34:03,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:34:03,757 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:34:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:34:29,324 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2019-10-01 22:34:29,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:34:29,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 22:34:29,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:34:31,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:34:31,268 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 32 treesize of output 22 [2019-10-01 22:34:31,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:34:31,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:34:31,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:34:31,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:34:31,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 22:34:31,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:34:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7095 backedges. 152 proven. 1248 refuted. 0 times theorem prover too weak. 5695 trivial. 0 not checked. [2019-10-01 22:34:31,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:34:31,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 30] total 84 [2019-10-01 22:34:31,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-10-01 22:34:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-10-01 22:34:31,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2045, Invalid=4927, Unknown=0, NotChecked=0, Total=6972 [2019-10-01 22:34:31,663 INFO L87 Difference]: Start difference. First operand 514 states and 620 transitions. Second operand 84 states. [2019-10-01 22:34:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:34:59,925 INFO L93 Difference]: Finished difference Result 980 states and 1191 transitions. [2019-10-01 22:34:59,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2019-10-01 22:34:59,925 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 341 [2019-10-01 22:34:59,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:34:59,928 INFO L225 Difference]: With dead ends: 980 [2019-10-01 22:34:59,928 INFO L226 Difference]: Without dead ends: 579 [2019-10-01 22:34:59,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 312 SyntacticMatches, 15 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37795 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=23111, Invalid=76429, Unknown=0, NotChecked=0, Total=99540 [2019-10-01 22:34:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-01 22:34:59,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 357. [2019-10-01 22:34:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-01 22:34:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 412 transitions. [2019-10-01 22:34:59,955 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 412 transitions. Word has length 341 [2019-10-01 22:34:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:34:59,955 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 412 transitions. [2019-10-01 22:34:59,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-10-01 22:34:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 412 transitions. [2019-10-01 22:34:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-10-01 22:34:59,960 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:34:59,960 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:34:59,960 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:34:59,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:34:59,961 INFO L82 PathProgramCache]: Analyzing trace with hash -195652421, now seen corresponding path program 25 times [2019-10-01 22:34:59,961 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:34:59,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:34:59,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:59,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:34:59,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7427 backedges. 18 proven. 2916 refuted. 0 times theorem prover too weak. 4493 trivial. 0 not checked. [2019-10-01 22:35:01,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:01,386 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:01,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:35:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:01,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-01 22:35:01,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7427 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 4511 trivial. 0 not checked. [2019-10-01 22:35:01,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:01,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-10-01 22:35:01,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 22:35:01,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 22:35:01,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:35:01,764 INFO L87 Difference]: Start difference. First operand 357 states and 412 transitions. Second operand 58 states. [2019-10-01 22:35:02,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:02,477 INFO L93 Difference]: Finished difference Result 607 states and 720 transitions. [2019-10-01 22:35:02,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-01 22:35:02,477 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 354 [2019-10-01 22:35:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:02,478 INFO L225 Difference]: With dead ends: 607 [2019-10-01 22:35:02,478 INFO L226 Difference]: Without dead ends: 365 [2019-10-01 22:35:02,479 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:35:02,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-10-01 22:35:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2019-10-01 22:35:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-10-01 22:35:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 418 transitions. [2019-10-01 22:35:02,500 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 418 transitions. Word has length 354 [2019-10-01 22:35:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:02,500 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 418 transitions. [2019-10-01 22:35:02,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 22:35:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 418 transitions. [2019-10-01 22:35:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-10-01 22:35:02,502 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:02,502 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:02,502 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1375340204, now seen corresponding path program 26 times [2019-10-01 22:35:02,503 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:02,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:02,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:35:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7696 backedges. 18 proven. 3025 refuted. 0 times theorem prover too weak. 4653 trivial. 0 not checked. [2019-10-01 22:35:03,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:03,835 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:04,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:35:04,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:35:04,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:04,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 22:35:04,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7696 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 4671 trivial. 0 not checked. [2019-10-01 22:35:04,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:04,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-01 22:35:04,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 22:35:04,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 22:35:04,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:35:04,219 INFO L87 Difference]: Start difference. First operand 362 states and 418 transitions. Second operand 59 states. [2019-10-01 22:35:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:04,889 INFO L93 Difference]: Finished difference Result 615 states and 730 transitions. [2019-10-01 22:35:04,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 22:35:04,889 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 359 [2019-10-01 22:35:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:04,891 INFO L225 Difference]: With dead ends: 615 [2019-10-01 22:35:04,891 INFO L226 Difference]: Without dead ends: 370 [2019-10-01 22:35:04,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:35:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-10-01 22:35:04,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2019-10-01 22:35:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-01 22:35:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 424 transitions. [2019-10-01 22:35:04,914 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 424 transitions. Word has length 359 [2019-10-01 22:35:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:04,914 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 424 transitions. [2019-10-01 22:35:04,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 22:35:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 424 transitions. [2019-10-01 22:35:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-10-01 22:35:04,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:04,916 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:04,916 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:04,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:04,916 INFO L82 PathProgramCache]: Analyzing trace with hash 979902751, now seen corresponding path program 27 times [2019-10-01 22:35:04,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:04,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:04,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:04,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7970 backedges. 18 proven. 3136 refuted. 0 times theorem prover too weak. 4816 trivial. 0 not checked. [2019-10-01 22:35:06,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:06,268 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:06,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:35:10,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-10-01 22:35:10,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:10,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-01 22:35:10,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:10,949 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-10-01 22:35:10,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:35:10,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:35:10,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:35:10,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 22:35:10,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7970 backedges. 41 proven. 1476 refuted. 0 times theorem prover too weak. 6453 trivial. 0 not checked. [2019-10-01 22:35:11,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:11,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 29] total 86 [2019-10-01 22:35:11,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-01 22:35:11,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-01 22:35:11,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2265, Invalid=5045, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 22:35:11,306 INFO L87 Difference]: Start difference. First operand 367 states and 424 transitions. Second operand 86 states. [2019-10-01 22:35:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:18,755 INFO L93 Difference]: Finished difference Result 814 states and 991 transitions. [2019-10-01 22:35:18,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-10-01 22:35:18,755 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 364 [2019-10-01 22:35:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:18,758 INFO L225 Difference]: With dead ends: 814 [2019-10-01 22:35:18,758 INFO L226 Difference]: Without dead ends: 566 [2019-10-01 22:35:18,761 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9792 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9018, Invalid=29594, Unknown=0, NotChecked=0, Total=38612 [2019-10-01 22:35:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-01 22:35:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 555. [2019-10-01 22:35:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-01 22:35:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 669 transitions. [2019-10-01 22:35:18,838 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 669 transitions. Word has length 364 [2019-10-01 22:35:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:18,838 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 669 transitions. [2019-10-01 22:35:18,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-01 22:35:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 669 transitions. [2019-10-01 22:35:18,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-10-01 22:35:18,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:18,840 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 55, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:18,840 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:18,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash 416147014, now seen corresponding path program 25 times [2019-10-01 22:35:18,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:18,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:18,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8249 backedges. 18 proven. 3249 refuted. 0 times theorem prover too weak. 4982 trivial. 0 not checked. [2019-10-01 22:35:20,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:20,246 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:20,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:35:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:20,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 22:35:20,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (58)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:35:20,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:20,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-10-01 22:35:20,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 22:35:20,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 22:35:20,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:35:20,721 INFO L87 Difference]: Start difference. First operand 555 states and 669 transitions. Second operand 61 states. [2019-10-01 22:35:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:21,662 INFO L93 Difference]: Finished difference Result 1002 states and 1236 transitions. [2019-10-01 22:35:21,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 22:35:21,662 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 369 [2019-10-01 22:35:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:21,664 INFO L225 Difference]: With dead ends: 1002 [2019-10-01 22:35:21,664 INFO L226 Difference]: Without dead ends: 568 [2019-10-01 22:35:21,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:35:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-01 22:35:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 563. [2019-10-01 22:35:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-01 22:35:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 679 transitions. [2019-10-01 22:35:21,706 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 679 transitions. Word has length 369 [2019-10-01 22:35:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:21,706 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 679 transitions. [2019-10-01 22:35:21,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 22:35:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 679 transitions. [2019-10-01 22:35:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-10-01 22:35:21,708 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:21,708 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 56, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:21,708 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1991336321, now seen corresponding path program 26 times [2019-10-01 22:35:21,708 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:21,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:21,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:35:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8533 backedges. 18 proven. 3364 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-10-01 22:35:23,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:23,203 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:23,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:35:23,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:35:23,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:23,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-01 22:35:23,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8533 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 5169 trivial. 0 not checked. [2019-10-01 22:35:23,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:23,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-10-01 22:35:23,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 22:35:23,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 22:35:23,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:35:23,639 INFO L87 Difference]: Start difference. First operand 563 states and 679 transitions. Second operand 62 states. [2019-10-01 22:35:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:24,408 INFO L93 Difference]: Finished difference Result 1016 states and 1254 transitions. [2019-10-01 22:35:24,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 22:35:24,409 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 374 [2019-10-01 22:35:24,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:24,411 INFO L225 Difference]: With dead ends: 1016 [2019-10-01 22:35:24,411 INFO L226 Difference]: Without dead ends: 576 [2019-10-01 22:35:24,412 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:35:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-01 22:35:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 571. [2019-10-01 22:35:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-01 22:35:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 689 transitions. [2019-10-01 22:35:24,453 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 689 transitions. Word has length 374 [2019-10-01 22:35:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:24,453 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 689 transitions. [2019-10-01 22:35:24,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 22:35:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 689 transitions. [2019-10-01 22:35:24,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-01 22:35:24,455 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:24,455 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 57, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:24,455 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:24,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:24,455 INFO L82 PathProgramCache]: Analyzing trace with hash -949685790, now seen corresponding path program 27 times [2019-10-01 22:35:24,455 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:24,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:24,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:24,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:24,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8822 backedges. 18 proven. 3481 refuted. 0 times theorem prover too weak. 5323 trivial. 0 not checked. [2019-10-01 22:35:26,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:26,032 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:26,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:35:28,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-10-01 22:35:28,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:28,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 22:35:28,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:31,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:35:31,442 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 32 treesize of output 22 [2019-10-01 22:35:31,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:31,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:35:31,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:35:31,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:35:31,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-10-01 22:35:31,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 8822 backedges. 170 proven. 1571 refuted. 0 times theorem prover too weak. 7081 trivial. 0 not checked. [2019-10-01 22:35:31,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:31,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 32] total 92 [2019-10-01 22:35:31,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-10-01 22:35:31,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-10-01 22:35:31,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2504, Invalid=5868, Unknown=0, NotChecked=0, Total=8372 [2019-10-01 22:35:31,916 INFO L87 Difference]: Start difference. First operand 571 states and 689 transitions. Second operand 92 states. [2019-10-01 22:36:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:36:04,393 INFO L93 Difference]: Finished difference Result 1086 states and 1320 transitions. [2019-10-01 22:36:04,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 284 states. [2019-10-01 22:36:04,394 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 379 [2019-10-01 22:36:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:36:04,397 INFO L225 Difference]: With dead ends: 1086 [2019-10-01 22:36:04,397 INFO L226 Difference]: Without dead ends: 640 [2019-10-01 22:36:04,402 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 347 SyntacticMatches, 17 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46479 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=28331, Invalid=93121, Unknown=0, NotChecked=0, Total=121452 [2019-10-01 22:36:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-10-01 22:36:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 395. [2019-10-01 22:36:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-10-01 22:36:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 456 transitions. [2019-10-01 22:36:04,428 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 456 transitions. Word has length 379 [2019-10-01 22:36:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:36:04,428 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 456 transitions. [2019-10-01 22:36:04,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-10-01 22:36:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 456 transitions. [2019-10-01 22:36:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-10-01 22:36:04,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:36:04,430 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:36:04,430 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:36:04,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:36:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash 676103838, now seen corresponding path program 28 times [2019-10-01 22:36:04,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:36:04,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:36:04,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:04,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:36:04,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:36:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9192 backedges. 20 proven. 3600 refuted. 0 times theorem prover too weak. 5572 trivial. 0 not checked. [2019-10-01 22:36:05,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:36:05,962 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:36:06,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:36:06,300 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:36:06,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:36:06,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-01 22:36:06,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:36:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9192 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 5592 trivial. 0 not checked. [2019-10-01 22:36:06,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:36:06,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2019-10-01 22:36:06,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-01 22:36:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-01 22:36:06,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:36:06,386 INFO L87 Difference]: Start difference. First operand 395 states and 456 transitions. Second operand 64 states. [2019-10-01 22:36:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:36:07,027 INFO L93 Difference]: Finished difference Result 671 states and 796 transitions. [2019-10-01 22:36:07,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-01 22:36:07,027 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 392 [2019-10-01 22:36:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:36:07,029 INFO L225 Difference]: With dead ends: 671 [2019-10-01 22:36:07,029 INFO L226 Difference]: Without dead ends: 403 [2019-10-01 22:36:07,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:36:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-10-01 22:36:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 400. [2019-10-01 22:36:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-10-01 22:36:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 462 transitions. [2019-10-01 22:36:07,058 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 462 transitions. Word has length 392 [2019-10-01 22:36:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:36:07,058 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 462 transitions. [2019-10-01 22:36:07,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-01 22:36:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 462 transitions. [2019-10-01 22:36:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-10-01 22:36:07,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:36:07,060 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:36:07,060 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:36:07,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:36:07,060 INFO L82 PathProgramCache]: Analyzing trace with hash 353643831, now seen corresponding path program 29 times [2019-10-01 22:36:07,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:36:07,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:36:07,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:07,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:36:07,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:36:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9491 backedges. 20 proven. 3721 refuted. 0 times theorem prover too weak. 5750 trivial. 0 not checked. [2019-10-01 22:36:08,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:36:08,597 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:36:08,797 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:37:02,455 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2019-10-01 22:37:02,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:37:02,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-01 22:37:02,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:37:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9491 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 4121 trivial. 0 not checked. [2019-10-01 22:37:02,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:37:02,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63] total 64 [2019-10-01 22:37:02,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-01 22:37:02,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-01 22:37:02,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:37:02,621 INFO L87 Difference]: Start difference. First operand 400 states and 462 transitions. Second operand 64 states. [2019-10-01 22:37:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:37:03,296 INFO L93 Difference]: Finished difference Result 679 states and 806 transitions. [2019-10-01 22:37:03,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-01 22:37:03,297 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 397 [2019-10-01 22:37:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:37:03,298 INFO L225 Difference]: With dead ends: 679 [2019-10-01 22:37:03,298 INFO L226 Difference]: Without dead ends: 408 [2019-10-01 22:37:03,299 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 22:37:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-10-01 22:37:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 405. [2019-10-01 22:37:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-10-01 22:37:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 468 transitions. [2019-10-01 22:37:03,325 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 468 transitions. Word has length 397 [2019-10-01 22:37:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:37:03,326 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 468 transitions. [2019-10-01 22:37:03,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-01 22:37:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 468 transitions. [2019-10-01 22:37:03,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-10-01 22:37:03,328 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:37:03,328 INFO L411 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:37:03,328 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:37:03,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:37:03,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1017859842, now seen corresponding path program 30 times [2019-10-01 22:37:03,328 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:37:03,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:37:03,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:03,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:37:03,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:37:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9795 backedges. 20 proven. 3844 refuted. 0 times theorem prover too weak. 5931 trivial. 0 not checked. [2019-10-01 22:37:04,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:37:04,935 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:37:05,144 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:40:34,557 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 59 check-sat command(s) [2019-10-01 22:40:34,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:40:34,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-01 22:40:34,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:40:35,472 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-10-01 22:40:35,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:40:35,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:40:35,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:40:35,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-01 22:40:35,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:40:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9795 backedges. 46 proven. 1825 refuted. 0 times theorem prover too weak. 7924 trivial. 0 not checked. [2019-10-01 22:40:35,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:40:35,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 31] total 94 [2019-10-01 22:40:35,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-10-01 22:40:35,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-10-01 22:40:35,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2748, Invalid=5994, Unknown=0, NotChecked=0, Total=8742 [2019-10-01 22:40:35,898 INFO L87 Difference]: Start difference. First operand 405 states and 468 transitions. Second operand 94 states. [2019-10-01 22:40:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:40:43,938 INFO L93 Difference]: Finished difference Result 897 states and 1092 transitions. [2019-10-01 22:40:43,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-01 22:40:43,938 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 402 [2019-10-01 22:40:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:40:43,941 INFO L225 Difference]: With dead ends: 897 [2019-10-01 22:40:43,941 INFO L226 Difference]: Without dead ends: 623 [2019-10-01 22:40:43,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11823 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10917, Invalid=35523, Unknown=0, NotChecked=0, Total=46440 [2019-10-01 22:40:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-01 22:40:43,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 612. [2019-10-01 22:40:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-01 22:40:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 738 transitions. [2019-10-01 22:40:43,992 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 738 transitions. Word has length 402 [2019-10-01 22:40:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:40:43,992 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 738 transitions. [2019-10-01 22:40:43,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-10-01 22:40:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 738 transitions. [2019-10-01 22:40:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-10-01 22:40:43,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:40:43,995 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 61, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:40:43,995 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:40:43,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:40:43,995 INFO L82 PathProgramCache]: Analyzing trace with hash 225874641, now seen corresponding path program 28 times [2019-10-01 22:40:43,995 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:40:43,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:40:43,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:43,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:40:43,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:40:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10104 backedges. 20 proven. 3969 refuted. 0 times theorem prover too weak. 6115 trivial. 0 not checked. [2019-10-01 22:40:45,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:40:45,666 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:40:45,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:40:46,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:40:46,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:40:46,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-01 22:40:46,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:40:46,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10104 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 6135 trivial. 0 not checked. [2019-10-01 22:40:46,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:40:46,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-10-01 22:40:46,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 22:40:46,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 22:40:46,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:40:46,156 INFO L87 Difference]: Start difference. First operand 612 states and 738 transitions. Second operand 67 states. [2019-10-01 22:40:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:40:47,089 INFO L93 Difference]: Finished difference Result 1104 states and 1362 transitions. [2019-10-01 22:40:47,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:40:47,090 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 407 [2019-10-01 22:40:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:40:47,092 INFO L225 Difference]: With dead ends: 1104 [2019-10-01 22:40:47,092 INFO L226 Difference]: Without dead ends: 625 [2019-10-01 22:40:47,093 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:40:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-10-01 22:40:47,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 620. [2019-10-01 22:40:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-01 22:40:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 748 transitions. [2019-10-01 22:40:47,140 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 748 transitions. Word has length 407 [2019-10-01 22:40:47,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:40:47,140 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 748 transitions. [2019-10-01 22:40:47,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 22:40:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 748 transitions. [2019-10-01 22:40:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-10-01 22:40:47,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:40:47,143 INFO L411 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 62, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:40:47,143 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:40:47,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:40:47,143 INFO L82 PathProgramCache]: Analyzing trace with hash -398217884, now seen corresponding path program 29 times [2019-10-01 22:40:47,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:40:47,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:40:47,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:47,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:40:47,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:40:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10418 backedges. 20 proven. 4096 refuted. 0 times theorem prover too weak. 6302 trivial. 0 not checked. [2019-10-01 22:40:48,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:40:48,811 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:40:49,029 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:41:41,148 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2019-10-01 22:41:41,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:41,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-01 22:41:41,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10418 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 4496 trivial. 0 not checked. [2019-10-01 22:41:41,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:41,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66] total 67 [2019-10-01 22:41:41,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 22:41:41,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 22:41:41,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:41:41,289 INFO L87 Difference]: Start difference. First operand 620 states and 748 transitions. Second operand 67 states. [2019-10-01 22:41:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:41,935 INFO L93 Difference]: Finished difference Result 1118 states and 1380 transitions. [2019-10-01 22:41:41,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 22:41:41,936 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 412 [2019-10-01 22:41:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:41,938 INFO L225 Difference]: With dead ends: 1118 [2019-10-01 22:41:41,938 INFO L226 Difference]: Without dead ends: 633 [2019-10-01 22:41:41,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:41:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-01 22:41:41,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 628. [2019-10-01 22:41:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-01 22:41:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 758 transitions. [2019-10-01 22:41:41,988 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 758 transitions. Word has length 412 [2019-10-01 22:41:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:41,988 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 758 transitions. [2019-10-01 22:41:41,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 22:41:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 758 transitions. [2019-10-01 22:41:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-10-01 22:41:41,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:41,991 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 63, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:41,991 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:41,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:41,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1056588397, now seen corresponding path program 30 times [2019-10-01 22:41:41,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:41,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:41,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:41,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:41,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10737 backedges. 20 proven. 4225 refuted. 0 times theorem prover too weak. 6492 trivial. 0 not checked. [2019-10-01 22:41:43,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:43,752 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:43,983 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE