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-tiling/skipped.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:45:11,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:45:11,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:45:11,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:45:11,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:45:11,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:45:11,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:45:11,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:45:11,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:45:11,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:45:11,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:45:11,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:45:11,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:45:11,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:45:11,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:45:11,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:45:11,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:45:11,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:45:11,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:45:11,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:45:11,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:45:11,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:45:11,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:45:11,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:45:11,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:45:11,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:45:11,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:45:11,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:45:11,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:45:11,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:45:11,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:45:11,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:45:11,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:45:11,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:45:11,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:45:11,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:45:11,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:45:11,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:45:11,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:45:11,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:45:11,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:45:11,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 11:45:11,349 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:45:11,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:45:11,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:45:11,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:45:11,351 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:45:11,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:45:11,351 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:45:11,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:45:11,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:45:11,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:45:11,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:45:11,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:45:11,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:45:11,353 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:45:11,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:45:11,353 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:45:11,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:45:11,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:45:11,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:45:11,354 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:45:11,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:45:11,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:45:11,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:45:11,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:45:11,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:45:11,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:45:11,355 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:45:11,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:45:11,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:45:11,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:45:11,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:45:11,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:45:11,405 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:45:11,405 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:45:11,406 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/skipped.c [2019-09-07 11:45:11,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165acd004/190b3d0b26e34e609e8ba101ac766e6e/FLAGae4b6aed9 [2019-09-07 11:45:11,901 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:45:11,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/skipped.c [2019-09-07 11:45:11,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165acd004/190b3d0b26e34e609e8ba101ac766e6e/FLAGae4b6aed9 [2019-09-07 11:45:12,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165acd004/190b3d0b26e34e609e8ba101ac766e6e [2019-09-07 11:45:12,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:45:12,289 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:45:12,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:45:12,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:45:12,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:45:12,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:45:12" (1/1) ... [2019-09-07 11:45:12,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abe9483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:45:12, skipping insertion in model container [2019-09-07 11:45:12,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:45:12" (1/1) ... [2019-09-07 11:45:12,309 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:45:12,331 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:45:12,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:45:12,540 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:45:12,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:45:12,579 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:45:12,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:45:12 WrapperNode [2019-09-07 11:45:12,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:45:12,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:45:12,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:45:12,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:45:12,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:45:12" (1/1) ... [2019-09-07 11:45:12,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:45:12" (1/1) ... [2019-09-07 11:45:12,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:45:12" (1/1) ... [2019-09-07 11:45:12,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:45:12" (1/1) ... [2019-09-07 11:45:12,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:45:12" (1/1) ... [2019-09-07 11:45:12,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:45:12" (1/1) ... [2019-09-07 11:45:12,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:45:12" (1/1) ... [2019-09-07 11:45:12,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:45:12,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:45:12,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:45:12,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:45:12,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:45:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:45:12,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:45:12,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:45:12,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 11:45:12,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:45:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:45:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-07 11:45:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 11:45:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:45:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-07 11:45:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:45:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-07 11:45:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:45:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:45:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:45:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:45:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:45:13,082 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:45:13,082 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 11:45:13,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:45:13 BoogieIcfgContainer [2019-09-07 11:45:13,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:45:13,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:45:13,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:45:13,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:45:13,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:45:12" (1/3) ... [2019-09-07 11:45:13,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11275499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:45:13, skipping insertion in model container [2019-09-07 11:45:13,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:45:12" (2/3) ... [2019-09-07 11:45:13,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11275499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:45:13, skipping insertion in model container [2019-09-07 11:45:13,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:45:13" (3/3) ... [2019-09-07 11:45:13,098 INFO L109 eAbstractionObserver]: Analyzing ICFG skipped.c [2019-09-07 11:45:13,110 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:45:13,118 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:45:13,135 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:45:13,163 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:45:13,164 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:45:13,164 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:45:13,164 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:45:13,164 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:45:13,164 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:45:13,165 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:45:13,165 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:45:13,165 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:45:13,183 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-09-07 11:45:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 11:45:13,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:13,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:13,192 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:13,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:13,197 INFO L82 PathProgramCache]: Analyzing trace with hash -446282704, now seen corresponding path program 1 times [2019-09-07 11:45:13,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:13,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:13,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:13,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:45:13,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:45:13,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 11:45:13,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 11:45:13,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 11:45:13,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:45:13,353 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-09-07 11:45:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:13,373 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2019-09-07 11:45:13,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 11:45:13,374 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-09-07 11:45:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:13,381 INFO L225 Difference]: With dead ends: 53 [2019-09-07 11:45:13,382 INFO L226 Difference]: Without dead ends: 26 [2019-09-07 11:45:13,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:45:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-07 11:45:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-07 11:45:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-07 11:45:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-07 11:45:13,420 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-09-07 11:45:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:13,421 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-07 11:45:13,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 11:45:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-07 11:45:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 11:45:13,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:13,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:13,423 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:13,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:13,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1281654888, now seen corresponding path program 1 times [2019-09-07 11:45:13,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:13,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:13,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:13,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:13,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:45:13,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:45:13,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:45:13,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:45:13,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:45:13,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:45:13,534 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-09-07 11:45:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:13,611 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-09-07 11:45:13,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:45:13,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-07 11:45:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:13,613 INFO L225 Difference]: With dead ends: 45 [2019-09-07 11:45:13,613 INFO L226 Difference]: Without dead ends: 28 [2019-09-07 11:45:13,614 INFO L628 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-09-07 11:45:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-07 11:45:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-07 11:45:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 11:45:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-07 11:45:13,621 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2019-09-07 11:45:13,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:13,621 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-07 11:45:13,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:45:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-07 11:45:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 11:45:13,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:13,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:13,623 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1237885334, now seen corresponding path program 1 times [2019-09-07 11:45:13,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:13,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:13,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:13,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 11:45:13,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:45:13,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 11:45:13,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:45:13,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:45:13,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:45:13,730 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-09-07 11:45:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:13,839 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-09-07 11:45:13,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:45:13,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-07 11:45:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:13,841 INFO L225 Difference]: With dead ends: 43 [2019-09-07 11:45:13,841 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 11:45:13,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:45:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 11:45:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-09-07 11:45:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 11:45:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-07 11:45:13,850 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2019-09-07 11:45:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:13,850 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-07 11:45:13,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:45:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-07 11:45:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 11:45:13,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:13,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:13,852 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:13,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1565802059, now seen corresponding path program 1 times [2019-09-07 11:45:13,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:13,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:13,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:13,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:13,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 11:45:13,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:13,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:45:13,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:14,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:45:14,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 11:45:14,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:14,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-07 11:45:14,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:45:14,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:45:14,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:45:14,079 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-09-07 11:45:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:14,168 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-09-07 11:45:14,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:45:14,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-07 11:45:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:14,169 INFO L225 Difference]: With dead ends: 49 [2019-09-07 11:45:14,169 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 11:45:14,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:45:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 11:45:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-07 11:45:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 11:45:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-09-07 11:45:14,185 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2019-09-07 11:45:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:14,186 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-09-07 11:45:14,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:45:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-09-07 11:45:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 11:45:14,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:14,188 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:14,188 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:14,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:14,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1209140727, now seen corresponding path program 2 times [2019-09-07 11:45:14,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:14,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:14,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:14,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:14,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:45:14,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:14,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:45:14,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:45:14,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:45:14,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:45:14,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:45:14,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:14,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-09-07 11:45:14,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:14,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:14,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:14,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-09-07 11:45:14,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 26 treesize of output 21 [2019-09-07 11:45:14,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:45:14,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:45:14,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:45:14,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-09-07 11:45:14,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:14,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:14,788 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:14,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:14,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:14,798 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2019-09-07 11:45:14,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:45:14,873 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:45:14,876 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:14,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-09-07 11:45:14,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:14,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:14,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:14,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-09-07 11:45:14,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:45:14,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:14,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2019-09-07 11:45:14,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:45:14,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:45:14,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:45:14,942 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 15 states. [2019-09-07 11:45:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:15,299 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2019-09-07 11:45:15,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:45:15,300 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-09-07 11:45:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:15,308 INFO L225 Difference]: With dead ends: 80 [2019-09-07 11:45:15,308 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 11:45:15,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:45:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 11:45:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 43. [2019-09-07 11:45:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 11:45:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-09-07 11:45:15,334 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 25 [2019-09-07 11:45:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:15,336 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-09-07 11:45:15,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:45:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-09-07 11:45:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 11:45:15,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:15,340 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:15,341 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:15,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:15,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1910205305, now seen corresponding path program 1 times [2019-09-07 11:45:15,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:15,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:15,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:15,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:45:15,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:45:15,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:15,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:45:15,663 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-09-07 11:45:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:15,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:45:15,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:15,768 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-09-07 11:45:15,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2019-09-07 11:45:15,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:15,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:15,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:15,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-09-07 11:45:15,849 INFO L341 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-09-07 11:45:15,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2019-09-07 11:45:15,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:15,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:15,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:15,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:45:15,867 INFO L567 ElimStorePlain]: treesize reduction 33, result has 17.5 percent of original size [2019-09-07 11:45:15,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:15,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-09-07 11:45:15,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:45:15,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:15,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-09-07 11:45:15,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 11:45:15,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 11:45:15,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:45:15,906 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 18 states. [2019-09-07 11:45:16,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:16,291 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-09-07 11:45:16,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 11:45:16,294 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-09-07 11:45:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:16,297 INFO L225 Difference]: With dead ends: 91 [2019-09-07 11:45:16,297 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 11:45:16,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2019-09-07 11:45:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 11:45:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 36. [2019-09-07 11:45:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-07 11:45:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-09-07 11:45:16,307 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 25 [2019-09-07 11:45:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:16,307 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-09-07 11:45:16,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 11:45:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-09-07 11:45:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 11:45:16,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:16,309 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:16,309 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:16,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash -466196341, now seen corresponding path program 1 times [2019-09-07 11:45:16,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:16,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:16,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:16,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:45:16,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:16,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:45:16,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:16,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:45:16,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:16,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-09-07 11:45:16,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:16,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:16,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 11:45:16,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-09-07 11:45:18,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:18,687 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 24 treesize of output 24 [2019-09-07 11:45:18,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:18,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:45:18,699 INFO L567 ElimStorePlain]: treesize reduction 14, result has 33.3 percent of original size [2019-09-07 11:45:18,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:18,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2019-09-07 11:45:18,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:45:18,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:18,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-09-07 11:45:18,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:45:18,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:45:18,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=171, Unknown=1, NotChecked=0, Total=210 [2019-09-07 11:45:18,757 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 15 states. [2019-09-07 11:45:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:19,125 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2019-09-07 11:45:19,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 11:45:19,126 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-09-07 11:45:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:19,128 INFO L225 Difference]: With dead ends: 82 [2019-09-07 11:45:19,128 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 11:45:19,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=65, Invalid=276, Unknown=1, NotChecked=0, Total=342 [2019-09-07 11:45:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 11:45:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 53. [2019-09-07 11:45:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 11:45:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-09-07 11:45:19,147 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 33 [2019-09-07 11:45:19,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:19,148 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-09-07 11:45:19,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:45:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-09-07 11:45:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 11:45:19,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:19,151 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:19,151 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:19,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2054544243, now seen corresponding path program 1 times [2019-09-07 11:45:19,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:19,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:19,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:45:19,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:19,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:45:19,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:19,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 11:45:19,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:20,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:20,157 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 21 treesize of output 21 [2019-09-07 11:45:20,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:20,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:45:20,183 INFO L567 ElimStorePlain]: treesize reduction 11, result has 38.9 percent of original size [2019-09-07 11:45:20,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:20,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2019-09-07 11:45:20,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:45:20,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:20,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2019-09-07 11:45:20,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:45:20,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:45:20,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:45:20,250 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 25 states. [2019-09-07 11:45:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:23,169 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2019-09-07 11:45:23,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 11:45:23,169 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 33 [2019-09-07 11:45:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:23,171 INFO L225 Difference]: With dead ends: 120 [2019-09-07 11:45:23,171 INFO L226 Difference]: Without dead ends: 118 [2019-09-07 11:45:23,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 11:45:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-07 11:45:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 44. [2019-09-07 11:45:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 11:45:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-07 11:45:23,183 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 33 [2019-09-07 11:45:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:23,183 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-07 11:45:23,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:45:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-07 11:45:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 11:45:23,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:23,184 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:23,184 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:23,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:23,185 INFO L82 PathProgramCache]: Analyzing trace with hash 107542303, now seen corresponding path program 2 times [2019-09-07 11:45:23,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:23,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:23,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:23,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:23,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 11:45:23,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:23,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:45:23,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:45:23,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:45:23,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:45:23,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:45:23,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 11:45:23,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:23,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-07 11:45:23,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:45:23,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:45:23,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:45:23,382 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 13 states. [2019-09-07 11:45:23,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:23,556 INFO L93 Difference]: Finished difference Result 118 states and 135 transitions. [2019-09-07 11:45:23,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 11:45:23,557 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2019-09-07 11:45:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:23,558 INFO L225 Difference]: With dead ends: 118 [2019-09-07 11:45:23,558 INFO L226 Difference]: Without dead ends: 63 [2019-09-07 11:45:23,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-07 11:45:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-07 11:45:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2019-09-07 11:45:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 11:45:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-09-07 11:45:23,574 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 41 [2019-09-07 11:45:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:23,575 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-09-07 11:45:23,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:45:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-09-07 11:45:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 11:45:23,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:23,580 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:23,581 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:23,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:23,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1506578719, now seen corresponding path program 3 times [2019-09-07 11:45:23,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:23,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:23,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:23,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:45:23,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:45:23,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:23,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:45:23,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:45:23,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:45:23,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:45:23,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:45:23,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:23,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:45:23,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:23,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 11:45:24,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:24,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 11:45:24,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:45:24,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:45:24,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:45:24,086 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 15 states. [2019-09-07 11:45:24,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:24,671 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2019-09-07 11:45:24,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 11:45:24,672 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2019-09-07 11:45:24,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:24,673 INFO L225 Difference]: With dead ends: 82 [2019-09-07 11:45:24,673 INFO L226 Difference]: Without dead ends: 57 [2019-09-07 11:45:24,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:45:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-07 11:45:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2019-09-07 11:45:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 11:45:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-09-07 11:45:24,682 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 43 [2019-09-07 11:45:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:24,683 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-09-07 11:45:24,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:45:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-09-07 11:45:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 11:45:24,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:24,684 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:24,684 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:24,685 INFO L82 PathProgramCache]: Analyzing trace with hash 995908250, now seen corresponding path program 4 times [2019-09-07 11:45:24,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:24,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:24,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:24,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:45:24,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 11:45:24,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:24,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:45:24,938 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:45:24,961 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:45:24,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:45:24,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 11:45:24,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 11:45:25,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:25,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 11:45:25,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:45:25,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:45:25,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:45:25,085 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 15 states. [2019-09-07 11:45:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:25,362 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-09-07 11:45:25,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 11:45:25,368 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-09-07 11:45:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:25,368 INFO L225 Difference]: With dead ends: 91 [2019-09-07 11:45:25,369 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 11:45:25,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:45:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 11:45:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-07 11:45:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 11:45:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-09-07 11:45:25,377 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 48 [2019-09-07 11:45:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:25,378 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-09-07 11:45:25,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:45:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-09-07 11:45:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 11:45:25,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:25,401 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:25,402 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:25,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1999502184, now seen corresponding path program 5 times [2019-09-07 11:45:25,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:25,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:25,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:25,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:45:25,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 11:45:25,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:25,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:45:25,615 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:45:25,672 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 11:45:25,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:45:25,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:45:25,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:25,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-09-07 11:45:25,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:25,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:25,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:25,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-09-07 11:45:25,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:45:25,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-09-07 11:45:25,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:25,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:25,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:25,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2019-09-07 11:45:26,013 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:45:26,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:45:26,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:26,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-09-07 11:45:26,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:26,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:26,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:26,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-09-07 11:45:26,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 11:45:26,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:26,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-09-07 11:45:26,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:45:26,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:45:26,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:45:26,097 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 26 states. [2019-09-07 11:45:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:27,148 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2019-09-07 11:45:27,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 11:45:27,149 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-09-07 11:45:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:27,151 INFO L225 Difference]: With dead ends: 153 [2019-09-07 11:45:27,151 INFO L226 Difference]: Without dead ends: 151 [2019-09-07 11:45:27,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 11:45:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-07 11:45:27,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2019-09-07 11:45:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-07 11:45:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2019-09-07 11:45:27,168 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 50 [2019-09-07 11:45:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:27,168 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2019-09-07 11:45:27,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:45:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2019-09-07 11:45:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 11:45:27,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:27,171 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:27,171 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash -76274150, now seen corresponding path program 1 times [2019-09-07 11:45:27,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:27,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:27,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:27,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:45:27,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:45:27,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:27,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:45:27,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:27,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:45:27,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:27,450 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:45:27,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-09-07 11:45:27,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:27,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:27,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:27,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-09-07 11:45:27,661 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-09-07 11:45:27,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2019-09-07 11:45:27,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:27,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:27,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:27,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:45:27,682 INFO L567 ElimStorePlain]: treesize reduction 37, result has 15.9 percent of original size [2019-09-07 11:45:27,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:27,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:7 [2019-09-07 11:45:27,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 11:45:27,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:27,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2019-09-07 11:45:27,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:45:27,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:45:27,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:45:27,739 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 23 states. [2019-09-07 11:45:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:28,485 INFO L93 Difference]: Finished difference Result 200 states and 236 transitions. [2019-09-07 11:45:28,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 11:45:28,485 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-09-07 11:45:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:28,488 INFO L225 Difference]: With dead ends: 200 [2019-09-07 11:45:28,488 INFO L226 Difference]: Without dead ends: 198 [2019-09-07 11:45:28,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 11:45:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-07 11:45:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 96. [2019-09-07 11:45:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-07 11:45:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-09-07 11:45:28,517 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 50 [2019-09-07 11:45:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:28,517 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-09-07 11:45:28,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:45:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-09-07 11:45:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 11:45:28,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:28,518 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:28,518 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:28,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:28,519 INFO L82 PathProgramCache]: Analyzing trace with hash 382840366, now seen corresponding path program 1 times [2019-09-07 11:45:28,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:28,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:28,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:45:29,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:29,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:45:29,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:29,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 11:45:29,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:40,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:40,577 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 21 treesize of output 21 [2019-09-07 11:45:40,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:40,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:45:40,587 INFO L567 ElimStorePlain]: treesize reduction 11, result has 38.9 percent of original size [2019-09-07 11:45:40,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:40,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2019-09-07 11:45:40,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 11:45:40,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:40,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 31 [2019-09-07 11:45:40,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:45:40,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:45:40,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=833, Unknown=2, NotChecked=0, Total=930 [2019-09-07 11:45:40,658 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 31 states. [2019-09-07 11:45:46,007 WARN L188 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2019-09-07 11:46:02,265 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 11:46:13,451 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-09-07 11:46:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:39,432 INFO L93 Difference]: Finished difference Result 390 states and 464 transitions. [2019-09-07 11:46:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 11:46:39,433 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-09-07 11:46:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:39,436 INFO L225 Difference]: With dead ends: 390 [2019-09-07 11:46:39,437 INFO L226 Difference]: Without dead ends: 320 [2019-09-07 11:46:39,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1654 ImplicationChecksByTransitivity, 56.3s TimeCoverageRelationStatistics Valid=639, Invalid=5194, Unknown=19, NotChecked=0, Total=5852 [2019-09-07 11:46:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-07 11:46:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 83. [2019-09-07 11:46:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 11:46:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2019-09-07 11:46:39,453 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 58 [2019-09-07 11:46:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:39,454 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2019-09-07 11:46:39,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 11:46:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2019-09-07 11:46:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 11:46:39,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:39,455 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:39,455 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash 776049600, now seen corresponding path program 6 times [2019-09-07 11:46:39,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:39,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:39,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:39,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:46:39,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 27 proven. 29 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 11:46:39,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:39,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:46:39,578 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:46:39,638 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 11:46:39,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:46:39,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 11:46:39,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 40 proven. 16 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 11:46:39,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:39,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-09-07 11:46:39,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:46:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:46:39,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:46:39,756 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 19 states. [2019-09-07 11:46:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:40,153 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2019-09-07 11:46:40,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 11:46:40,154 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-09-07 11:46:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:40,155 INFO L225 Difference]: With dead ends: 150 [2019-09-07 11:46:40,155 INFO L226 Difference]: Without dead ends: 94 [2019-09-07 11:46:40,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:46:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-07 11:46:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2019-09-07 11:46:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-07 11:46:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-09-07 11:46:40,174 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 66 [2019-09-07 11:46:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:40,174 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-09-07 11:46:40,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:46:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-09-07 11:46:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 11:46:40,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:40,176 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:40,176 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1913387582, now seen corresponding path program 7 times [2019-09-07 11:46:40,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:40,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:40,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:40,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:46:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 17 proven. 23 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-07 11:46:40,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:40,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:46:40,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:46:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:40,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 11:46:40,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 11:46:40,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:40,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-09-07 11:46:40,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:46:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:46:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:46:40,788 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 20 states. [2019-09-07 11:46:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:41,333 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-09-07 11:46:41,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 11:46:41,333 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-09-07 11:46:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:41,334 INFO L225 Difference]: With dead ends: 123 [2019-09-07 11:46:41,334 INFO L226 Difference]: Without dead ends: 82 [2019-09-07 11:46:41,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:46:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-07 11:46:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2019-09-07 11:46:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 11:46:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2019-09-07 11:46:41,345 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 68 [2019-09-07 11:46:41,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:41,345 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2019-09-07 11:46:41,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:46:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2019-09-07 11:46:41,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 11:46:41,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:41,346 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:41,347 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash 970231981, now seen corresponding path program 8 times [2019-09-07 11:46:41,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:41,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:41,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:41,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:46:41,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-07 11:46:41,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:41,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:46:41,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:46:41,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:46:41,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:46:41,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 11:46:41,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 11:46:41,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:41,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-07 11:46:41,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:46:41,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:46:41,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:46:41,960 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 20 states. [2019-09-07 11:46:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:42,389 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2019-09-07 11:46:42,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:46:42,389 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2019-09-07 11:46:42,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:42,391 INFO L225 Difference]: With dead ends: 137 [2019-09-07 11:46:42,391 INFO L226 Difference]: Without dead ends: 79 [2019-09-07 11:46:42,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:46:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-07 11:46:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-09-07 11:46:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-07 11:46:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-09-07 11:46:42,411 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 73 [2019-09-07 11:46:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:42,411 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-09-07 11:46:42,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:46:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-09-07 11:46:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 11:46:42,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:42,412 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:42,413 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:42,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:42,413 INFO L82 PathProgramCache]: Analyzing trace with hash -679509905, now seen corresponding path program 9 times [2019-09-07 11:46:42,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:42,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:42,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:42,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:46:42,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 8 proven. 86 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 11:46:43,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:43,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:46:43,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:46:43,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 11:46:43,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:46:43,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 11:46:43,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:43,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-09-07 11:46:43,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:43,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:43,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:43,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-07 11:46:43,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 25 [2019-09-07 11:46:43,278 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:46:43,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2019-09-07 11:46:43,279 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:43,286 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-09-07 11:46:43,287 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:43,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:43,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:43,291 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-09-07 11:46:43,808 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-09-07 11:46:43,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2019-09-07 11:46:43,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:43,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:43,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:46:43,826 INFO L567 ElimStorePlain]: treesize reduction 33, result has 17.5 percent of original size [2019-09-07 11:46:43,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:43,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:7 [2019-09-07 11:46:43,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:46:43,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:43,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16] total 37 [2019-09-07 11:46:43,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 11:46:43,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 11:46:43,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:46:43,918 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 37 states. [2019-09-07 11:46:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:50,943 INFO L93 Difference]: Finished difference Result 701 states and 879 transitions. [2019-09-07 11:46:50,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-07 11:46:50,945 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 75 [2019-09-07 11:46:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:50,948 INFO L225 Difference]: With dead ends: 701 [2019-09-07 11:46:50,949 INFO L226 Difference]: Without dead ends: 655 [2019-09-07 11:46:50,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 60 SyntacticMatches, 10 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7852 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1992, Invalid=20060, Unknown=0, NotChecked=0, Total=22052 [2019-09-07 11:46:50,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-07 11:46:50,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 182. [2019-09-07 11:46:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-07 11:46:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 211 transitions. [2019-09-07 11:46:50,987 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 211 transitions. Word has length 75 [2019-09-07 11:46:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:50,987 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 211 transitions. [2019-09-07 11:46:50,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 11:46:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 211 transitions. [2019-09-07 11:46:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 11:46:50,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:50,989 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:50,989 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:50,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:50,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1576903183, now seen corresponding path program 2 times [2019-09-07 11:46:50,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:50,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:50,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:46:50,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 8 proven. 86 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 11:46:51,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:51,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:46:51,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:46:51,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:46:51,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:46:51,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 11:46:51,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:51,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-09-07 11:46:51,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:51,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:51,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:51,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-07 11:46:51,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:51,932 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:46:51,934 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:51,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-09-07 11:46:51,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:51,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:51,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:51,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-09-07 11:46:51,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:46:52,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:52,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2019-09-07 11:46:52,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 11:46:52,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 11:46:52,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:46:52,025 INFO L87 Difference]: Start difference. First operand 182 states and 211 transitions. Second operand 35 states. [2019-09-07 11:46:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:54,735 INFO L93 Difference]: Finished difference Result 510 states and 654 transitions. [2019-09-07 11:46:54,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 11:46:54,736 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 75 [2019-09-07 11:46:54,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:54,739 INFO L225 Difference]: With dead ends: 510 [2019-09-07 11:46:54,740 INFO L226 Difference]: Without dead ends: 508 [2019-09-07 11:46:54,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 60 SyntacticMatches, 14 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1947 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=702, Invalid=5304, Unknown=0, NotChecked=0, Total=6006 [2019-09-07 11:46:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-09-07 11:46:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 158. [2019-09-07 11:46:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-07 11:46:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 179 transitions. [2019-09-07 11:46:54,768 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 179 transitions. Word has length 75 [2019-09-07 11:46:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:54,769 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 179 transitions. [2019-09-07 11:46:54,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 11:46:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 179 transitions. [2019-09-07 11:46:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 11:46:54,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:54,770 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:54,770 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:54,770 INFO L82 PathProgramCache]: Analyzing trace with hash -760144123, now seen corresponding path program 2 times [2019-09-07 11:46:54,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:54,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:54,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:54,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:46:54,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 10 proven. 104 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-07 11:46:55,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:55,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:46:55,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:46:55,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:46:55,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:46:55,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:46:55,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:56,373 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:46:56,375 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:56,376 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 17 treesize of output 10 [2019-09-07 11:46:56,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:56,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:56,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:56,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-09-07 11:46:56,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-07 11:46:56,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:56,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 43 [2019-09-07 11:46:56,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 11:46:56,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 11:46:56,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1655, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 11:46:56,487 INFO L87 Difference]: Start difference. First operand 158 states and 179 transitions. Second operand 43 states. [2019-09-07 11:47:04,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:47:04,319 INFO L93 Difference]: Finished difference Result 838 states and 1076 transitions. [2019-09-07 11:47:04,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-07 11:47:04,320 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-09-07 11:47:04,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:47:04,325 INFO L225 Difference]: With dead ends: 838 [2019-09-07 11:47:04,325 INFO L226 Difference]: Without dead ends: 836 [2019-09-07 11:47:04,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 63 SyntacticMatches, 9 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8619 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2302, Invalid=22820, Unknown=0, NotChecked=0, Total=25122 [2019-09-07 11:47:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2019-09-07 11:47:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 197. [2019-09-07 11:47:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-07 11:47:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 225 transitions. [2019-09-07 11:47:04,377 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 225 transitions. Word has length 83 [2019-09-07 11:47:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:47:04,377 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 225 transitions. [2019-09-07 11:47:04,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 11:47:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 225 transitions. [2019-09-07 11:47:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 11:47:04,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:47:04,379 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:47:04,379 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:47:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:47:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash -549289577, now seen corresponding path program 10 times [2019-09-07 11:47:04,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:47:04,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:47:04,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:04,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:47:04,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 63 proven. 57 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 11:47:04,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:47:04,517 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:47:04,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:47:04,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:47:04,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:47:04,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:47:04,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:47:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 11:47:04,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:04,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-09-07 11:47:04,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:47:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:47:04,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:47:04,723 INFO L87 Difference]: Start difference. First operand 197 states and 225 transitions. Second operand 25 states. [2019-09-07 11:47:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:47:05,345 INFO L93 Difference]: Finished difference Result 368 states and 420 transitions. [2019-09-07 11:47:05,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:47:05,346 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 91 [2019-09-07 11:47:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:47:05,349 INFO L225 Difference]: With dead ends: 368 [2019-09-07 11:47:05,349 INFO L226 Difference]: Without dead ends: 219 [2019-09-07 11:47:05,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:47:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-07 11:47:05,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 174. [2019-09-07 11:47:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-07 11:47:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 194 transitions. [2019-09-07 11:47:05,386 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 194 transitions. Word has length 91 [2019-09-07 11:47:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:47:05,387 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 194 transitions. [2019-09-07 11:47:05,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:47:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 194 transitions. [2019-09-07 11:47:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 11:47:05,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:47:05,388 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:47:05,389 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:47:05,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:47:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash 315475161, now seen corresponding path program 11 times [2019-09-07 11:47:05,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:47:05,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:47:05,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:05,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:47:05,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 37 proven. 42 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-07 11:47:05,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:47:05,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:47:05,963 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:47:06,074 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-07 11:47:06,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:47:06,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:47:06,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:47:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 36 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 11:47:06,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:06,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-09-07 11:47:06,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:47:06,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:47:06,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:47:06,330 INFO L87 Difference]: Start difference. First operand 174 states and 194 transitions. Second operand 26 states. [2019-09-07 11:47:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:47:07,184 INFO L93 Difference]: Finished difference Result 304 states and 336 transitions. [2019-09-07 11:47:07,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 11:47:07,188 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-09-07 11:47:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:47:07,190 INFO L225 Difference]: With dead ends: 304 [2019-09-07 11:47:07,190 INFO L226 Difference]: Without dead ends: 181 [2019-09-07 11:47:07,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=294, Invalid=966, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:47:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-07 11:47:07,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 101. [2019-09-07 11:47:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-07 11:47:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2019-09-07 11:47:07,216 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 93 [2019-09-07 11:47:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:47:07,216 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2019-09-07 11:47:07,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:47:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2019-09-07 11:47:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 11:47:07,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:47:07,218 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:47:07,219 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:47:07,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:47:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2130099778, now seen corresponding path program 12 times [2019-09-07 11:47:07,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:47:07,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:47:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:07,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:47:07,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 12 proven. 49 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-09-07 11:47:07,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:47:07,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:47:07,856 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:47:08,078 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-07 11:47:08,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:47:08,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 11:47:08,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:47:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 34 proven. 49 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 11:47:08,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:08,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2019-09-07 11:47:08,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:47:08,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:47:08,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:47:08,563 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 25 states. [2019-09-07 11:47:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:47:09,174 INFO L93 Difference]: Finished difference Result 183 states and 203 transitions. [2019-09-07 11:47:09,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 11:47:09,175 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 98 [2019-09-07 11:47:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:47:09,176 INFO L225 Difference]: With dead ends: 183 [2019-09-07 11:47:09,176 INFO L226 Difference]: Without dead ends: 104 [2019-09-07 11:47:09,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 11:47:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-07 11:47:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-07 11:47:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-07 11:47:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2019-09-07 11:47:09,202 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 98 [2019-09-07 11:47:09,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:47:09,202 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2019-09-07 11:47:09,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:47:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2019-09-07 11:47:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 11:47:09,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:47:09,204 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:47:09,204 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:47:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:47:09,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2642752, now seen corresponding path program 13 times [2019-09-07 11:47:09,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:47:09,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:47:09,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:09,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:47:09,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 12 proven. 169 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-07 11:47:09,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:47:09,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:47:09,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:47:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:09,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 11:47:09,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:47:09,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-09-07 11:47:09,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:09,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:09,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:09,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-09-07 11:47:09,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 25 [2019-09-07 11:47:09,828 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:47:09,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2019-09-07 11:47:09,829 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:09,841 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-09-07 11:47:09,842 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:09,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:09,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:09,848 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-09-07 11:47:10,478 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-09-07 11:47:10,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2019-09-07 11:47:10,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:10,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:10,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:47:10,494 INFO L567 ElimStorePlain]: treesize reduction 33, result has 17.5 percent of original size [2019-09-07 11:47:10,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:10,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:7 [2019-09-07 11:47:10,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 178 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 11:47:10,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:10,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2019-09-07 11:47:10,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 11:47:10,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 11:47:10,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:47:10,596 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 33 states. [2019-09-07 11:47:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:47:21,090 INFO L93 Difference]: Finished difference Result 1095 states and 1481 transitions. [2019-09-07 11:47:21,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2019-09-07 11:47:21,090 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2019-09-07 11:47:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:47:21,095 INFO L225 Difference]: With dead ends: 1095 [2019-09-07 11:47:21,095 INFO L226 Difference]: Without dead ends: 1093 [2019-09-07 11:47:21,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 77 SyntacticMatches, 19 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26142 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=4176, Invalid=56586, Unknown=0, NotChecked=0, Total=60762 [2019-09-07 11:47:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2019-09-07 11:47:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 206. [2019-09-07 11:47:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-07 11:47:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 231 transitions. [2019-09-07 11:47:21,146 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 231 transitions. Word has length 100 [2019-09-07 11:47:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:47:21,146 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 231 transitions. [2019-09-07 11:47:21,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 11:47:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 231 transitions. [2019-09-07 11:47:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 11:47:21,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:47:21,148 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:47:21,148 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:47:21,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:47:21,149 INFO L82 PathProgramCache]: Analyzing trace with hash 558057026, now seen corresponding path program 3 times [2019-09-07 11:47:21,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:47:21,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:47:21,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:21,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:47:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 12 proven. 170 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 11:47:22,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:47:22,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:47:22,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:47:22,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 11:47:22,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:47:22,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 11:47:22,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:47:22,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:22,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-09-07 11:47:22,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:22,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:22,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:22,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-07 11:47:23,559 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:47:23,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:23,561 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:23,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-09-07 11:47:23,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:23,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:23,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:23,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-09-07 11:47:23,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-07 11:47:23,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:23,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 21] total 49 [2019-09-07 11:47:23,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 11:47:23,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 11:47:23,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2168, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:47:23,779 INFO L87 Difference]: Start difference. First operand 206 states and 231 transitions. Second operand 49 states. [2019-09-07 11:47:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:47:44,567 INFO L93 Difference]: Finished difference Result 2280 states and 2997 transitions. [2019-09-07 11:47:44,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2019-09-07 11:47:44,568 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 100 [2019-09-07 11:47:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:47:44,578 INFO L225 Difference]: With dead ends: 2280 [2019-09-07 11:47:44,578 INFO L226 Difference]: Without dead ends: 2118 [2019-09-07 11:47:44,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38436 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=7501, Invalid=87055, Unknown=0, NotChecked=0, Total=94556 [2019-09-07 11:47:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-09-07 11:47:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 204. [2019-09-07 11:47:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-07 11:47:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 229 transitions. [2019-09-07 11:47:44,644 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 229 transitions. Word has length 100 [2019-09-07 11:47:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:47:44,644 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 229 transitions. [2019-09-07 11:47:44,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 11:47:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 229 transitions. [2019-09-07 11:47:44,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-07 11:47:44,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:47:44,646 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:47:44,646 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:47:44,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:47:44,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1815094870, now seen corresponding path program 3 times [2019-09-07 11:47:44,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:47:44,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:47:44,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:44,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:47:44,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 14 proven. 196 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 11:47:45,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:47:45,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:47:45,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:47:45,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 11:47:45,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:47:45,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 11:47:45,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:47:45,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-09-07 11:47:45,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:45,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:45,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:45,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-09-07 11:47:46,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:46,350 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:47:46,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:46,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-09-07 11:47:46,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:46,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:46,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:46,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-09-07 11:47:46,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-07 11:47:46,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:46,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2019-09-07 11:47:46,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 11:47:46,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 11:47:46,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1716, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 11:47:46,499 INFO L87 Difference]: Start difference. First operand 204 states and 229 transitions. Second operand 44 states. [2019-09-07 11:48:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:48:10,171 INFO L93 Difference]: Finished difference Result 3074 states and 4264 transitions. [2019-09-07 11:48:10,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 377 states. [2019-09-07 11:48:10,172 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 108 [2019-09-07 11:48:10,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:48:10,183 INFO L225 Difference]: With dead ends: 3074 [2019-09-07 11:48:10,183 INFO L226 Difference]: Without dead ends: 3072 [2019-09-07 11:48:10,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 78 SyntacticMatches, 17 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73110 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=12088, Invalid=148312, Unknown=0, NotChecked=0, Total=160400 [2019-09-07 11:48:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-09-07 11:48:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 214. [2019-09-07 11:48:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-07 11:48:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 240 transitions. [2019-09-07 11:48:10,260 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 240 transitions. Word has length 108 [2019-09-07 11:48:10,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:48:10,260 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 240 transitions. [2019-09-07 11:48:10,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 11:48:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 240 transitions. [2019-09-07 11:48:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 11:48:10,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:48:10,262 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:48:10,262 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:48:10,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:48:10,263 INFO L82 PathProgramCache]: Analyzing trace with hash 260172776, now seen corresponding path program 14 times [2019-09-07 11:48:10,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:48:10,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:48:10,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:10,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:48:10,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:48:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 115 proven. 93 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-07 11:48:10,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:48:10,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:48:10,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:48:10,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:48:10,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:48:10,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:48:10,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:48:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 144 proven. 64 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-07 11:48:10,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:48:10,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2019-09-07 11:48:10,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:48:10,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:48:10,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:48:10,765 INFO L87 Difference]: Start difference. First operand 214 states and 240 transitions. Second operand 31 states. [2019-09-07 11:48:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:48:11,510 INFO L93 Difference]: Finished difference Result 408 states and 461 transitions. [2019-09-07 11:48:11,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 11:48:11,511 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 116 [2019-09-07 11:48:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:48:11,512 INFO L225 Difference]: With dead ends: 408 [2019-09-07 11:48:11,513 INFO L226 Difference]: Without dead ends: 247 [2019-09-07 11:48:11,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=433, Invalid=1459, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 11:48:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-07 11:48:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 188. [2019-09-07 11:48:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-07 11:48:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2019-09-07 11:48:11,559 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 116 [2019-09-07 11:48:11,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:48:11,559 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2019-09-07 11:48:11,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 11:48:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2019-09-07 11:48:11,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-07 11:48:11,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:48:11,561 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:48:11,561 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:48:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:48:11,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1189120282, now seen corresponding path program 15 times [2019-09-07 11:48:11,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:48:11,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:48:11,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:11,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:48:11,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:48:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 65 proven. 66 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-07 11:48:12,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:48:12,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:48:12,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:48:12,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 11:48:12,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:48:12,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 11:48:12,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:48:12,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:48:12,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:12,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 144 proven. 34 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-09-07 11:48:12,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:48:12,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-09-07 11:48:12,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 11:48:12,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 11:48:12,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:48:12,854 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand 33 states. [2019-09-07 11:48:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:48:14,287 INFO L93 Difference]: Finished difference Result 360 states and 396 transitions. [2019-09-07 11:48:14,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 11:48:14,287 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 118 [2019-09-07 11:48:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:48:14,289 INFO L225 Difference]: With dead ends: 360 [2019-09-07 11:48:14,289 INFO L226 Difference]: Without dead ends: 228 [2019-09-07 11:48:14,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=392, Invalid=1678, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 11:48:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-07 11:48:14,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 194. [2019-09-07 11:48:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-07 11:48:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 211 transitions. [2019-09-07 11:48:14,346 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 211 transitions. Word has length 118 [2019-09-07 11:48:14,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:48:14,346 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 211 transitions. [2019-09-07 11:48:14,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 11:48:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 211 transitions. [2019-09-07 11:48:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 11:48:14,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:48:14,348 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:48:14,348 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:48:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:48:14,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2114010021, now seen corresponding path program 16 times [2019-09-07 11:48:14,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:48:14,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:48:14,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:14,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:48:14,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:48:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-09-07 11:48:14,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:48:14,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:48:14,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:48:15,018 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:48:15,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:48:15,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 11:48:15,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:48:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 55 proven. 81 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 11:48:15,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:48:15,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2019-09-07 11:48:15,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 11:48:15,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 11:48:15,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:48:15,403 INFO L87 Difference]: Start difference. First operand 194 states and 211 transitions. Second operand 30 states. [2019-09-07 11:48:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:48:16,290 INFO L93 Difference]: Finished difference Result 365 states and 399 transitions. [2019-09-07 11:48:16,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 11:48:16,291 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 123 [2019-09-07 11:48:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:48:16,291 INFO L225 Difference]: With dead ends: 365 [2019-09-07 11:48:16,292 INFO L226 Difference]: Without dead ends: 197 [2019-09-07 11:48:16,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=255, Invalid=1385, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 11:48:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-07 11:48:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-09-07 11:48:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-07 11:48:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 213 transitions. [2019-09-07 11:48:16,330 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 213 transitions. Word has length 123 [2019-09-07 11:48:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:48:16,330 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 213 transitions. [2019-09-07 11:48:16,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 11:48:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 213 transitions. [2019-09-07 11:48:16,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-07 11:48:16,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:48:16,331 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:48:16,331 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:48:16,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:48:16,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1386285337, now seen corresponding path program 17 times [2019-09-07 11:48:16,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:48:16,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:48:16,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:16,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:48:16,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:48:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 16 proven. 282 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-07 11:48:16,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:48:16,857 INFO L223 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-09-07 11:48:16,870 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:48:17,111 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-07 11:48:17,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:48:17,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-07 11:48:17,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:48:17,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-09-07 11:48:17,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:48:17,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:48:17,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:48:17,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-09-07 11:48:17,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:17,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-09-07 11:48:17,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:48:17,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:48:17,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:48:17,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2019-09-07 11:48:18,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:18,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:48:18,551 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:48:18,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-09-07 11:48:18,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:48:18,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:48:18,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:48:18,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-09-07 11:48:18,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 0 proven. 298 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-07 11:48:18,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:48:18,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 50 [2019-09-07 11:48:18,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 11:48:18,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 11:48:18,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2245, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 11:48:18,698 INFO L87 Difference]: Start difference. First operand 196 states and 213 transitions. Second operand 50 states. [2019-09-07 11:49:13,271 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-07 11:49:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:49:19,443 INFO L93 Difference]: Finished difference Result 6871 states and 9713 transitions. [2019-09-07 11:49:19,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 908 states. [2019-09-07 11:49:19,451 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 125 [2019-09-07 11:49:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:49:19,471 INFO L225 Difference]: With dead ends: 6871 [2019-09-07 11:49:19,472 INFO L226 Difference]: Without dead ends: 6869 [2019-09-07 11:49:19,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1039 GetRequests, 88 SyntacticMatches, 21 SemanticMatches, 930 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417904 ImplicationChecksByTransitivity, 46.8s TimeCoverageRelationStatistics Valid=40304, Invalid=827388, Unknown=0, NotChecked=0, Total=867692 [2019-09-07 11:49:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6869 states. [2019-09-07 11:49:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6869 to 426. [2019-09-07 11:49:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-07 11:49:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 477 transitions. [2019-09-07 11:49:19,822 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 477 transitions. Word has length 125 [2019-09-07 11:49:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:49:19,822 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 477 transitions. [2019-09-07 11:49:19,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 11:49:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 477 transitions. [2019-09-07 11:49:19,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-07 11:49:19,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:49:19,828 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:49:19,829 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:49:19,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:49:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash 347819113, now seen corresponding path program 4 times [2019-09-07 11:49:19,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:49:19,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:49:19,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:49:19,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:49:19,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:49:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:49:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 16 proven. 283 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-07 11:49:20,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:49:20,469 INFO L223 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-09-07 11:49:20,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:49:20,521 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:49:20,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:49:20,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 11:49:20,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:49:20,567 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:49:20,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-09-07 11:49:20,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:49:20,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:49:20,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:49:20,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-09-07 11:49:21,872 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-09-07 11:49:21,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2019-09-07 11:49:21,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:21,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:21,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:21,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:49:21,893 INFO L567 ElimStorePlain]: treesize reduction 37, result has 15.9 percent of original size [2019-09-07 11:49:21,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:49:21,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:7 [2019-09-07 11:49:21,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-09-07 11:49:22,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:49:22,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 41 [2019-09-07 11:49:22,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 11:49:22,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 11:49:22,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 11:49:22,023 INFO L87 Difference]: Start difference. First operand 426 states and 477 transitions. Second operand 41 states. [2019-09-07 11:49:38,587 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-09-07 11:50:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:50:09,292 INFO L93 Difference]: Finished difference Result 9440 states and 13462 transitions. [2019-09-07 11:50:09,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 605 states. [2019-09-07 11:50:09,293 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 125 [2019-09-07 11:50:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:50:09,324 INFO L225 Difference]: With dead ends: 9440 [2019-09-07 11:50:09,325 INFO L226 Difference]: Without dead ends: 9438 [2019-09-07 11:50:09,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 100 SyntacticMatches, 30 SemanticMatches, 615 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178882 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=22368, Invalid=357703, Unknown=1, NotChecked=0, Total=380072 [2019-09-07 11:50:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9438 states. [2019-09-07 11:50:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9438 to 354. [2019-09-07 11:50:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-07 11:50:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 383 transitions. [2019-09-07 11:50:09,507 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 383 transitions. Word has length 125 [2019-09-07 11:50:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:50:09,507 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 383 transitions. [2019-09-07 11:50:09,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 11:50:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 383 transitions. [2019-09-07 11:50:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-07 11:50:09,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:50:09,509 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:50:09,510 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:50:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:50:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash 648942973, now seen corresponding path program 4 times [2019-09-07 11:50:09,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:50:09,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:50:09,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:50:09,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:50:09,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:50:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:50:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 33 proven. 302 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 11:50:10,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:50:10,746 INFO L223 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-09-07 11:50:10,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:50:10,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:50:10,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:50:10,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 11:50:10,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:51:16,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:51:16,867 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 21 treesize of output 21 [2019-09-07 11:51:16,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:51:16,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:51:16,876 INFO L567 ElimStorePlain]: treesize reduction 11, result has 38.9 percent of original size [2019-09-07 11:51:16,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:51:16,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2019-09-07 11:51:16,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:51:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-09-07 11:51:17,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:51:17,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 23] total 54 [2019-09-07 11:51:17,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-07 11:51:17,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-07 11:51:17,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2688, Unknown=2, NotChecked=0, Total=2862 [2019-09-07 11:51:17,018 INFO L87 Difference]: Start difference. First operand 354 states and 383 transitions. Second operand 54 states. [2019-09-07 11:52:39,539 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2019-09-07 11:52:43,666 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-07 11:52:45,046 WARN L188 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-07 11:52:49,297 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-07 11:53:33,227 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-07 11:53:41,429 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-09-07 11:53:49,698 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-07 11:54:20,635 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-07 11:54:20,802 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-07 11:54:20,979 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-07 11:54:21,316 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-07 11:54:21,971 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-07 11:54:23,295 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-07 11:54:25,958 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-07 11:54:31,537 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-07 11:54:32,012 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-07 11:54:43,629 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-07 11:55:32,254 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-07 11:55:32,453 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-07 11:55:32,655 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-07 11:55:32,865 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-07 11:55:33,055 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-07 11:55:33,251 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-07 11:55:33,449 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-07 11:55:33,666 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-07 11:55:33,869 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-07 11:55:34,064 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-07 11:55:34,266 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-07 11:55:34,485 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-07 11:55:34,689 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-07 11:55:34,913 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-07 11:55:35,140 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-07 11:55:35,414 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-07 11:55:35,609 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-07 11:55:35,821 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-07 11:55:36,021 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-07 11:55:36,246 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-07 11:55:36,443 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-07 11:55:36,664 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-07 11:55:36,883 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-07 11:55:37,158 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-07 11:55:37,357 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-07 11:55:37,577 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-07 11:55:37,796 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-07 11:55:38,073 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-07 11:55:38,290 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-07 11:55:39,371 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-07 11:55:39,582 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-07 11:55:39,790 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-07 11:55:40,019 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-07 11:55:40,230 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-07 11:55:40,456 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-07 11:55:40,690 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-07 11:55:41,157 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-07 11:55:41,384 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-07 11:55:41,612 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-07 11:55:41,887 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-07 11:55:42,104 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-07 11:55:42,361 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-07 11:55:42,846 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-07 11:55:43,420 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-07 11:55:43,645 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-07 11:55:43,869 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-07 11:55:44,144 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-07 11:55:44,366 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 11:55:44,641 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-07 11:55:44,913 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-07 11:55:45,504 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-07 11:55:45,794 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-07 11:55:46,060 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-07 11:55:46,670 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-07 11:55:48,089 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-07 11:55:48,295 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-07 11:55:48,492 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-07 11:55:48,719 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-07 11:55:48,919 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-07 11:55:49,146 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-07 11:55:49,365 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-07 11:55:49,640 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-07 11:55:49,847 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-07 11:55:50,075 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-07 11:55:50,295 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-07 11:55:50,570 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-07 11:55:50,787 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-07 11:55:51,052 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-07 11:55:51,300 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-07 11:55:51,861 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-07 11:55:52,081 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 11:55:52,301 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 11:55:52,554 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-07 11:55:52,768 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-07 11:55:53,267 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-07 11:55:53,827 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 11:55:54,090 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-07 11:55:54,338 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-07 11:55:54,925 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-07 11:55:56,299 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-07 11:55:56,522 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 11:55:56,738 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 11:55:57,003 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-07 11:55:57,213 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-07 11:55:57,473 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-07 11:55:57,720 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-07 11:55:58,061 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-07 11:56:00,344 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 11:56:00,596 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-07 11:56:01,436 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-07 11:56:02,867 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-07 11:56:03,133 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-07 11:56:03,388 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-07 11:56:03,984 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-07 11:56:05,389 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-07 11:56:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:56:14,026 INFO L93 Difference]: Finished difference Result 15182 states and 21620 transitions. [2019-09-07 11:56:14,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1375 states. [2019-09-07 11:56:14,026 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 133 [2019-09-07 11:56:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:56:14,057 INFO L225 Difference]: With dead ends: 15182 [2019-09-07 11:56:14,057 INFO L226 Difference]: Without dead ends: 14888 [2019-09-07 11:56:14,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1530 GetRequests, 102 SyntacticMatches, 19 SemanticMatches, 1409 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961011 ImplicationChecksByTransitivity, 263.3s TimeCoverageRelationStatistics Valid=94491, Invalid=1895011, Unknown=8, NotChecked=0, Total=1989510 [2019-09-07 11:56:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14888 states. [2019-09-07 11:56:14,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14888 to 510. [2019-09-07 11:56:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-09-07 11:56:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 587 transitions. [2019-09-07 11:56:14,486 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 587 transitions. Word has length 133 [2019-09-07 11:56:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:56:14,486 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 587 transitions. [2019-09-07 11:56:14,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-07 11:56:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 587 transitions. [2019-09-07 11:56:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-07 11:56:14,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:56:14,489 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:56:14,489 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:56:14,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:56:14,490 INFO L82 PathProgramCache]: Analyzing trace with hash 857081871, now seen corresponding path program 18 times [2019-09-07 11:56:14,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:56:14,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:56:14,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:56:14,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:56:14,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:56:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:56:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 183 proven. 137 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-09-07 11:56:14,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:56:14,951 INFO L223 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-09-07 11:56:14,961 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:56:15,539 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-07 11:56:15,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:56:15,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 11:56:15,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:56:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 220 proven. 100 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-09-07 11:56:15,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:56:15,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2019-09-07 11:56:15,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 11:56:15,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 11:56:15,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1015, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:56:15,806 INFO L87 Difference]: Start difference. First operand 510 states and 587 transitions. Second operand 37 states. [2019-09-07 11:56:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:56:17,103 INFO L93 Difference]: Finished difference Result 1000 states and 1157 transitions. [2019-09-07 11:56:17,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:56:17,103 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 141 [2019-09-07 11:56:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:56:17,105 INFO L225 Difference]: With dead ends: 1000 [2019-09-07 11:56:17,106 INFO L226 Difference]: Without dead ends: 597 [2019-09-07 11:56:17,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=618, Invalid=2138, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 11:56:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-07 11:56:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 462. [2019-09-07 11:56:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-09-07 11:56:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 523 transitions. [2019-09-07 11:56:17,373 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 523 transitions. Word has length 141 [2019-09-07 11:56:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:56:17,373 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 523 transitions. [2019-09-07 11:56:17,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 11:56:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 523 transitions. [2019-09-07 11:56:17,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 11:56:17,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:56:17,376 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:56:17,376 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:56:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:56:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1601685807, now seen corresponding path program 19 times [2019-09-07 11:56:17,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:56:17,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:56:17,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:56:17,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:56:17,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:56:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:56:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 101 proven. 95 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-07 11:56:18,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:56:18,330 INFO L223 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-09-07 11:56:18,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:56:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:56:18,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 11:56:18,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:56:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 100 proven. 76 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-07 11:56:18,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:56:18,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-09-07 11:56:18,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 11:56:18,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 11:56:18,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1103, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:56:18,872 INFO L87 Difference]: Start difference. First operand 462 states and 523 transitions. Second operand 38 states. [2019-09-07 11:56:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:56:20,644 INFO L93 Difference]: Finished difference Result 914 states and 1042 transitions. [2019-09-07 11:56:20,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 11:56:20,645 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 143 [2019-09-07 11:56:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:56:20,648 INFO L225 Difference]: With dead ends: 914 [2019-09-07 11:56:20,648 INFO L226 Difference]: Without dead ends: 562 [2019-09-07 11:56:20,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=2232, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 11:56:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-07 11:56:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 470. [2019-09-07 11:56:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-07 11:56:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 529 transitions. [2019-09-07 11:56:21,026 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 529 transitions. Word has length 143 [2019-09-07 11:56:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:56:21,027 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 529 transitions. [2019-09-07 11:56:21,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 11:56:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 529 transitions. [2019-09-07 11:56:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-07 11:56:21,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:56:21,029 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:56:21,029 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:56:21,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:56:21,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1300235754, now seen corresponding path program 20 times [2019-09-07 11:56:21,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:56:21,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:56:21,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:56:21,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:56:21,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:56:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:56:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 20 proven. 121 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2019-09-07 11:56:21,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:56:21,820 INFO L223 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-09-07 11:56:21,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:56:21,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:56:21,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:56:21,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 11:56:21,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:56:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 81 proven. 121 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-07 11:56:22,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:56:22,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 35 [2019-09-07 11:56:22,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 11:56:22,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 11:56:22,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:56:22,435 INFO L87 Difference]: Start difference. First operand 470 states and 529 transitions. Second operand 35 states. [2019-09-07 11:56:23,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:56:23,937 INFO L93 Difference]: Finished difference Result 913 states and 1031 transitions. [2019-09-07 11:56:23,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 11:56:23,937 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 148 [2019-09-07 11:56:23,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:56:23,939 INFO L225 Difference]: With dead ends: 913 [2019-09-07 11:56:23,939 INFO L226 Difference]: Without dead ends: 473 [2019-09-07 11:56:23,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 11:56:23,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-09-07 11:56:24,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 472. [2019-09-07 11:56:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-07 11:56:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 531 transitions. [2019-09-07 11:56:24,225 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 531 transitions. Word has length 148 [2019-09-07 11:56:24,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:56:24,225 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 531 transitions. [2019-09-07 11:56:24,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 11:56:24,225 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 531 transitions. [2019-09-07 11:56:24,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-07 11:56:24,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:56:24,227 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:56:24,227 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:56:24,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:56:24,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1786910952, now seen corresponding path program 21 times [2019-09-07 11:56:24,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:56:24,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:56:24,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:56:24,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:56:24,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:56:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:56:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 54 proven. 391 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-07 11:56:25,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:56:25,852 INFO L223 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-09-07 11:56:25,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:56:26,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 11:56:26,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:56:26,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 11:56:26,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:56:26,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-09-07 11:56:26,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:56:26,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:56:26,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:56:26,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-07 11:56:26,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 25 [2019-09-07 11:56:26,850 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:56:26,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2019-09-07 11:56:26,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:56:26,861 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-09-07 11:56:26,861 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:56:26,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:56:26,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:56:26,866 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-09-07 11:56:28,670 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-09-07 11:56:28,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2019-09-07 11:56:28,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:56:28,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:56:28,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:56:28,686 INFO L567 ElimStorePlain]: treesize reduction 33, result has 17.5 percent of original size [2019-09-07 11:56:28,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:56:28,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:7 [2019-09-07 11:56:28,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:56:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 11:56:28,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:56:28,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 25] total 61 [2019-09-07 11:56:28,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 11:56:28,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 11:56:28,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3430, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 11:56:28,871 INFO L87 Difference]: Start difference. First operand 472 states and 531 transitions. Second operand 61 states. [2019-09-07 11:57:13,101 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-07 11:58:04,445 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-09-07 11:58:18,744 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 11:58:32,625 WARN L188 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 37 DAG size of output: 34