java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:44:12,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:44:12,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:44:12,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:44:12,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:44:12,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:44:12,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:44:12,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:44:12,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:44:12,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:44:12,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:44:12,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:44:12,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:44:12,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:44:12,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:44:12,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:44:12,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:44:12,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:44:12,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:44:12,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:44:12,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:44:12,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:44:12,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:44:12,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:44:12,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:44:12,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:44:12,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:44:12,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:44:12,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:44:12,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:44:12,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:44:12,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:44:12,328 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:44:12,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:44:12,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:44:12,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:44:12,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:44:12,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:44:12,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:44:12,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:44:12,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:44:12,340 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-03 19:44:12,369 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:44:12,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:44:12,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:44:12,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:44:12,372 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:44:12,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:44:12,372 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:44:12,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:44:12,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:44:12,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:44:12,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:44:12,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:44:12,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:44:12,374 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:44:12,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:44:12,375 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:44:12,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:44:12,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:44:12,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:44:12,376 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:44:12,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:44:12,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:44:12,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:44:12,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:44:12,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:44:12,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:44:12,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:44:12,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:44:12,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:44:12,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:44:12,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:44:12,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:44:12,445 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:44:12,446 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:44:12,446 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2019-09-03 19:44:12,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a994478/d40870a5da2f4c3987cdc6d066d7068c/FLAG012a3de8f [2019-09-03 19:44:12,951 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:44:12,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2019-09-03 19:44:12,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a994478/d40870a5da2f4c3987cdc6d066d7068c/FLAG012a3de8f [2019-09-03 19:44:13,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a994478/d40870a5da2f4c3987cdc6d066d7068c [2019-09-03 19:44:13,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:44:13,359 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:44:13,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:44:13,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:44:13,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:44:13,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:44:13" (1/1) ... [2019-09-03 19:44:13,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374b1c44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:44:13, skipping insertion in model container [2019-09-03 19:44:13,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:44:13" (1/1) ... [2019-09-03 19:44:13,374 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:44:13,386 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:44:13,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:44:13,539 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:44:13,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:44:13,673 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:44:13,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:44:13 WrapperNode [2019-09-03 19:44:13,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:44:13,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:44:13,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:44:13,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:44:13,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:44:13" (1/1) ... [2019-09-03 19:44:13,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:44:13" (1/1) ... [2019-09-03 19:44:13,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:44:13" (1/1) ... [2019-09-03 19:44:13,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:44:13" (1/1) ... [2019-09-03 19:44:13,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:44:13" (1/1) ... [2019-09-03 19:44:13,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:44:13" (1/1) ... [2019-09-03 19:44:13,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:44:13" (1/1) ... [2019-09-03 19:44:13,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:44:13,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:44:13,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:44:13,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:44:13,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:44:13" (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-03 19:44:13,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:44:13,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:44:13,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:44:13,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:44:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:44:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:44:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:44:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:44:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:44:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:44:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:44:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:44:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:44:15,996 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:44:15,996 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 19:44:15,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:44:15 BoogieIcfgContainer [2019-09-03 19:44:15,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:44:16,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:44:16,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:44:16,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:44:16,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:44:13" (1/3) ... [2019-09-03 19:44:16,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b84bb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:44:16, skipping insertion in model container [2019-09-03 19:44:16,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:44:13" (2/3) ... [2019-09-03 19:44:16,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b84bb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:44:16, skipping insertion in model container [2019-09-03 19:44:16,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:44:15" (3/3) ... [2019-09-03 19:44:16,013 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_1-1.i [2019-09-03 19:44:16,033 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:44:16,043 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:44:16,086 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:44:16,119 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:44:16,120 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:44:16,120 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:44:16,120 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:44:16,120 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:44:16,121 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:44:16,121 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:44:16,121 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:44:16,121 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:44:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-03 19:44:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:44:16,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:44:16,144 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:44:16,145 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:44:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:44:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash -956066777, now seen corresponding path program 1 times [2019-09-03 19:44:16,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:44:16,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:44:16,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:16,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:44:16,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:16,269 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-03 19:44:16,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:44:16,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:44:16,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:44:16,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:44:16,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:44:16,286 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-03 19:44:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:44:16,304 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-09-03 19:44:16,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:44:16,305 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-03 19:44:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:44:16,314 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:44:16,314 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:44:16,317 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-03 19:44:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:44:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 19:44:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:44:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-03 19:44:16,352 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2019-09-03 19:44:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:44:16,353 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-03 19:44:16,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:44:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-03 19:44:16,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:44:16,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:44:16,355 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:44:16,355 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:44:16,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:44:16,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1471973101, now seen corresponding path program 1 times [2019-09-03 19:44:16,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:44:16,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:44:16,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:16,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:44:16,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:16,439 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-03 19:44:16,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:44:16,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:44:16,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:44:16,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:44:16,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:44:16,442 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 3 states. [2019-09-03 19:44:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:44:16,487 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-09-03 19:44:16,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:44:16,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-03 19:44:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:44:16,490 INFO L225 Difference]: With dead ends: 43 [2019-09-03 19:44:16,490 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:44:16,491 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-03 19:44:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:44:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-09-03 19:44:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:44:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-03 19:44:16,502 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2019-09-03 19:44:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:44:16,502 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-03 19:44:16,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:44:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-03 19:44:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:44:16,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:44:16,503 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:44:16,504 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:44:16,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:44:16,504 INFO L82 PathProgramCache]: Analyzing trace with hash 534952077, now seen corresponding path program 1 times [2019-09-03 19:44:16,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:44:16,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:44:16,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:16,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:44:16,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:44:16,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:44:16,621 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-03 19:44:16,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:44:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:16,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:44:16,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:44:16,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-03 19:44:16,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:16,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:44:16,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:44:16,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-09-03 19:44:16,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-03 19:44:16,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:16,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:44:16,804 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-03 19:44:16,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-09-03 19:44:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:44:16,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:44:16,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 9 [2019-09-03 19:44:16,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:44:16,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:44:16,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:44:16,840 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 9 states. [2019-09-03 19:44:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:44:17,028 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-09-03 19:44:17,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:44:17,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-09-03 19:44:17,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:44:17,031 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:44:17,031 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 19:44:17,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:44:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 19:44:17,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-09-03 19:44:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 19:44:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-09-03 19:44:17,041 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2019-09-03 19:44:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:44:17,041 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-09-03 19:44:17,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:44:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-09-03 19:44:17,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:44:17,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:44:17,043 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:44:17,043 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:44:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:44:17,044 INFO L82 PathProgramCache]: Analyzing trace with hash 909633835, now seen corresponding path program 1 times [2019-09-03 19:44:17,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:44:17,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:44:17,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:17,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:44:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 19:44:17,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:44:17,190 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-03 19:44:17,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:44:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:17,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:44:17,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:44:17,294 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:17,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:17,301 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:17,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:17,351 INFO L567 ElimStorePlain]: treesize reduction 158, result has 14.1 percent of original size [2019-09-03 19:44:17,351 INFO L464 ElimStorePlain]: Eliminatee v_prenex_2 vanished before elimination [2019-09-03 19:44:17,351 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-09-03 19:44:17,355 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 19 treesize of output 15 [2019-09-03 19:44:17,355 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:17,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:44:17,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:44:17,368 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:271, output treesize:22 [2019-09-03 19:44:17,621 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:44:17,621 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 25 treesize of output 25 [2019-09-03 19:44:17,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-03 19:44:17,643 INFO L567 ElimStorePlain]: treesize reduction 13, result has 48.0 percent of original size [2019-09-03 19:44:17,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:44:17,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:12 [2019-09-03 19:44:17,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:44:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:44:17,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:44:17,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 14 [2019-09-03 19:44:17,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:44:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:44:17,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:44:17,729 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 14 states. [2019-09-03 19:44:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:44:18,285 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-09-03 19:44:18,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:44:18,286 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-09-03 19:44:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:44:18,287 INFO L225 Difference]: With dead ends: 76 [2019-09-03 19:44:18,287 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 19:44:18,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:44:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 19:44:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-09-03 19:44:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:44:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-03 19:44:18,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 27 [2019-09-03 19:44:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:44:18,305 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-03 19:44:18,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:44:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-03 19:44:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:44:18,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:44:18,307 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-03 19:44:18,307 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:44:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:44:18,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1108091277, now seen corresponding path program 1 times [2019-09-03 19:44:18,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:44:18,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:44:18,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:18,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:44:18,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:44:18,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:44:18,454 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:44:18,471 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-03 19:44:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:18,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:44:18,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:44:18,534 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 42 treesize of output 38 [2019-09-03 19:44:18,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:18,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:18,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 1 [2019-09-03 19:44:18,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:18,600 INFO L567 ElimStorePlain]: treesize reduction 204, result has 9.7 percent of original size [2019-09-03 19:44:18,601 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_9| vanished before elimination [2019-09-03 19:44:18,601 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-09-03 19:44:18,601 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-09-03 19:44:18,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:44:18,602 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:271, output treesize:22 [2019-09-03 19:44:18,962 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:44:18,963 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 25 treesize of output 25 [2019-09-03 19:44:18,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-03 19:44:18,982 INFO L567 ElimStorePlain]: treesize reduction 13, result has 48.0 percent of original size [2019-09-03 19:44:18,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:44:18,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:12 [2019-09-03 19:44:19,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:44:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:44:19,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:44:19,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15] total 16 [2019-09-03 19:44:19,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:44:19,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:44:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:44:19,062 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 16 states. [2019-09-03 19:44:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:44:21,797 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2019-09-03 19:44:21,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:44:21,798 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-09-03 19:44:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:44:21,799 INFO L225 Difference]: With dead ends: 98 [2019-09-03 19:44:21,799 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 19:44:21,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:44:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 19:44:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2019-09-03 19:44:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 19:44:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-09-03 19:44:21,816 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 38 [2019-09-03 19:44:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:44:21,816 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-09-03 19:44:21,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:44:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-09-03 19:44:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:44:21,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:44:21,820 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:44:21,821 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:44:21,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:44:21,821 INFO L82 PathProgramCache]: Analyzing trace with hash 224814507, now seen corresponding path program 2 times [2019-09-03 19:44:21,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:44:21,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:44:21,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:21,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:44:21,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 19:44:22,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:44:22,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:44:22,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:44:22,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:44:22,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:44:22,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:44:22,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:44:22,124 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:22,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:22,174 INFO L567 ElimStorePlain]: treesize reduction 194, result has 11.8 percent of original size [2019-09-03 19:44:22,174 INFO L464 ElimStorePlain]: Eliminatee v_prenex_13 vanished before elimination [2019-09-03 19:44:22,174 INFO L464 ElimStorePlain]: Eliminatee v_prenex_12 vanished before elimination [2019-09-03 19:44:22,178 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 19 treesize of output 15 [2019-09-03 19:44:22,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:22,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:44:22,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:44:22,188 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:271, output treesize:22 [2019-09-03 19:44:22,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:44:22,694 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 25 treesize of output 25 [2019-09-03 19:44:22,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-03 19:44:22,708 INFO L567 ElimStorePlain]: treesize reduction 13, result has 48.0 percent of original size [2019-09-03 19:44:22,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:44:22,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:12 [2019-09-03 19:44:22,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:44:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 19:44:22,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:44:22,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17] total 18 [2019-09-03 19:44:22,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:44:22,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:44:22,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:44:22,786 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 18 states. [2019-09-03 19:44:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:44:26,848 INFO L93 Difference]: Finished difference Result 205 states and 236 transitions. [2019-09-03 19:44:26,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:44:26,848 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2019-09-03 19:44:26,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:44:26,851 INFO L225 Difference]: With dead ends: 205 [2019-09-03 19:44:26,851 INFO L226 Difference]: Without dead ends: 166 [2019-09-03 19:44:26,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:44:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-03 19:44:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 113. [2019-09-03 19:44:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 19:44:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2019-09-03 19:44:26,902 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 49 [2019-09-03 19:44:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:44:26,902 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2019-09-03 19:44:26,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:44:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2019-09-03 19:44:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 19:44:26,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:44:26,904 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:44:26,904 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:44:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:44:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1521287449, now seen corresponding path program 3 times [2019-09-03 19:44:26,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:44:26,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:44:26,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:26,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:44:26,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 19:44:27,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:44:27,055 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) [2019-09-03 19:44:27,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:44:39,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 19:44:39,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:44:39,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:44:39,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:44:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 19:44:39,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:44:39,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 19:44:39,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:44:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:44:39,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:44:39,839 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 10 states. [2019-09-03 19:44:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:44:40,120 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2019-09-03 19:44:40,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:44:40,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-09-03 19:44:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:44:40,122 INFO L225 Difference]: With dead ends: 149 [2019-09-03 19:44:40,123 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 19:44:40,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:44:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 19:44:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-09-03 19:44:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 19:44:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2019-09-03 19:44:40,147 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 53 [2019-09-03 19:44:40,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:44:40,148 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2019-09-03 19:44:40,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:44:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2019-09-03 19:44:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 19:44:40,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:44:40,149 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:44:40,149 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:44:40,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:44:40,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1569539003, now seen corresponding path program 4 times [2019-09-03 19:44:40,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:44:40,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:44:40,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:40,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:44:40,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 19:44:40,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:44:40,351 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) [2019-09-03 19:44:40,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:44:40,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:44:40,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:44:40,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:44:40,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:44:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 19:44:40,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:44:40,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-03 19:44:40,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:44:40,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:44:40,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:44:40,440 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 11 states. [2019-09-03 19:44:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:44:40,807 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2019-09-03 19:44:40,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:44:40,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-09-03 19:44:40,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:44:40,809 INFO L225 Difference]: With dead ends: 148 [2019-09-03 19:44:40,809 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 19:44:40,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:44:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 19:44:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2019-09-03 19:44:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-03 19:44:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2019-09-03 19:44:40,823 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 55 [2019-09-03 19:44:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:44:40,823 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2019-09-03 19:44:40,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:44:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2019-09-03 19:44:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 19:44:40,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:44:40,825 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:44:40,825 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:44:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:44:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash -694642141, now seen corresponding path program 5 times [2019-09-03 19:44:40,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:44:40,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:44:40,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:40,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:44:40,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:44:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:44:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 64 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 19:44:40,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:44:40,990 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-03 19:44:41,001 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:44:57,011 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-03 19:44:57,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:44:57,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 19:44:57,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:44:57,054 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:57,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,059 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:57,059 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,097 INFO L567 ElimStorePlain]: treesize reduction 158, result has 14.1 percent of original size [2019-09-03 19:44:57,098 INFO L464 ElimStorePlain]: Eliminatee v_prenex_21 vanished before elimination [2019-09-03 19:44:57,098 INFO L464 ElimStorePlain]: Eliminatee v_prenex_20 vanished before elimination [2019-09-03 19:44:57,100 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 19 treesize of output 15 [2019-09-03 19:44:57,100 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:44:57,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,115 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:271, output treesize:22 [2019-09-03 19:44:57,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:44:57,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:44:57,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:44:57,186 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:57,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,190 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:57,190 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,193 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:57,194 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:57,205 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 61 treesize of output 60 [2019-09-03 19:44:57,206 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,209 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:57,210 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,212 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:57,212 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,245 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-09-03 19:44:57,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,245 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:385, output treesize:41 [2019-09-03 19:44:57,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:44:57,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:44:57,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:44:57,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:57,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:57,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:57,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 79 [2019-09-03 19:44:57,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,395 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:57,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:57,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:57,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:57,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 80 [2019-09-03 19:44:57,422 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,427 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:57,427 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,430 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:57,430 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:57,433 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:57,433 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:59,664 WARN L188 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-03 19:44:59,664 INFO L567 ElimStorePlain]: treesize reduction 90, result has 39.2 percent of original size [2019-09-03 19:44:59,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:44:59,665 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:487, output treesize:58 [2019-09-03 19:44:59,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:44:59,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:44:59,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:44:59,838 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:59,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:59,843 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:59,843 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:59,847 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:59,847 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:59,851 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:44:59,852 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:44:59,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:59,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:59,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:59,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:59,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:59,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:44:59,983 INFO L235 Elim1Store]: Index analysis took 115 ms [2019-09-03 19:45:00,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 102 [2019-09-03 19:45:00,028 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:00,032 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:00,032 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:02,159 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-03 19:45:02,159 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.8 percent of original size [2019-09-03 19:45:02,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:45:02,160 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:601, output treesize:77 [2019-09-03 19:45:02,425 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-09-03 19:45:02,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:02,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:02,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:02,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,810 INFO L235 Elim1Store]: Index analysis took 240 ms [2019-09-03 19:45:02,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 122 [2019-09-03 19:45:02,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:02,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:02,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 121 [2019-09-03 19:45:02,976 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:02,982 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:02,982 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:02,986 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:02,986 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:02,991 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:02,991 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:02,996 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:02,996 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:04,623 WARN L188 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-03 19:45:04,623 INFO L567 ElimStorePlain]: treesize reduction 126, result has 42.7 percent of original size [2019-09-03 19:45:04,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:45:04,624 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:703, output treesize:94 [2019-09-03 19:45:05,335 WARN L188 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-09-03 19:45:05,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:05,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:05,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:05,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:05,924 INFO L235 Elim1Store]: Index analysis took 540 ms [2019-09-03 19:45:06,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 144 [2019-09-03 19:45:06,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:06,096 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:06,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:06,105 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:06,105 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:06,109 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:06,110 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:06,119 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:06,120 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:06,125 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:06,125 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:07,513 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-03 19:45:07,514 INFO L567 ElimStorePlain]: treesize reduction 16, result has 87.6 percent of original size [2019-09-03 19:45:07,514 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-03 19:45:07,515 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:817, output treesize:113 [2019-09-03 19:45:10,687 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-03 19:45:12,670 WARN L188 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 66 [2019-09-03 19:45:12,670 INFO L341 Elim1Store]: treesize reduction 350, result has 23.4 percent of original size [2019-09-03 19:45:12,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 116 treesize of output 146 [2019-09-03 19:45:12,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:12,722 INFO L567 ElimStorePlain]: treesize reduction 119, result has 9.2 percent of original size [2019-09-03 19:45:12,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:45:12,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:122, output treesize:12 [2019-09-03 19:45:12,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 88 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 19:45:13,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:45:13,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 27] total 33 [2019-09-03 19:45:13,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:45:13,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:45:13,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:45:13,120 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 33 states. [2019-09-03 19:45:15,821 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-03 19:45:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:45:25,733 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2019-09-03 19:45:25,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:45:25,735 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 57 [2019-09-03 19:45:25,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:45:25,737 INFO L225 Difference]: With dead ends: 236 [2019-09-03 19:45:25,737 INFO L226 Difference]: Without dead ends: 173 [2019-09-03 19:45:25,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:45:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-03 19:45:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 88. [2019-09-03 19:45:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 19:45:25,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-09-03 19:45:25,756 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 57 [2019-09-03 19:45:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:45:25,757 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-09-03 19:45:25,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:45:25,757 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-09-03 19:45:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-03 19:45:25,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:45:25,758 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:45:25,758 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:45:25,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:45:25,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1732347775, now seen corresponding path program 6 times [2019-09-03 19:45:25,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:45:25,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:45:25,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:25,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:45:25,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:45:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 19:45:25,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:45:25,948 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) [2019-09-03 19:45:25,964 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:45:26,833 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-03 19:45:26,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:45:26,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:45:26,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:45:26,852 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:26,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:26,901 INFO L567 ElimStorePlain]: treesize reduction 194, result has 11.8 percent of original size [2019-09-03 19:45:26,902 INFO L464 ElimStorePlain]: Eliminatee v_prenex_28 vanished before elimination [2019-09-03 19:45:26,903 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 19 treesize of output 15 [2019-09-03 19:45:26,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:26,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:45:26,912 INFO L464 ElimStorePlain]: Eliminatee v_prenex_26 vanished before elimination [2019-09-03 19:45:26,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:45:26,912 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:271, output treesize:22 [2019-09-03 19:45:26,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:26,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:26,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:26,982 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:26,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:26,985 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:26,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:26,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:27,005 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 60 treesize of output 59 [2019-09-03 19:45:27,006 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:27,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:27,020 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 61 treesize of output 60 [2019-09-03 19:45:27,020 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:27,023 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:27,023 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:27,026 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:27,026 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:27,076 INFO L567 ElimStorePlain]: treesize reduction 73, result has 36.0 percent of original size [2019-09-03 19:45:27,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:45:27,076 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:385, output treesize:41 [2019-09-03 19:45:27,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:27,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:27,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:27,206 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:27,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:27,210 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:27,210 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:27,213 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:27,214 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:27,217 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:27,217 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:27,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:27,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:27,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:27,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 80 [2019-09-03 19:45:27,241 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:27,244 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:27,245 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:29,374 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-03 19:45:29,375 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.4 percent of original size [2019-09-03 19:45:29,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:45:29,375 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:487, output treesize:58 [2019-09-03 19:45:30,047 WARN L188 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-09-03 19:45:30,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:30,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:30,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:30,162 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:30,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:30,167 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:30,167 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:30,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:30,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:30,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:30,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:30,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:30,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:30,302 INFO L235 Elim1Store]: Index analysis took 108 ms [2019-09-03 19:45:30,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 101 [2019-09-03 19:45:30,350 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:30,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:30,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:30,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:30,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:30,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:30,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:30,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 102 [2019-09-03 19:45:30,404 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:30,407 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:30,407 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:30,410 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:30,411 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:33,557 WARN L188 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-03 19:45:33,557 INFO L567 ElimStorePlain]: treesize reduction 109, result has 41.4 percent of original size [2019-09-03 19:45:33,558 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-03 19:45:33,558 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:601, output treesize:77 [2019-09-03 19:45:33,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:33,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:33,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:37,675 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (+ (* 4 (mod (+ v_prenex_29 4294967295) 4294967296)) |main_~#array~0.offset|) (+ (* 4 (mod (+ v_prenex_29 4294967294) 4294967296)) |main_~#array~0.offset|)) [2019-09-03 19:45:37,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:37,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:37,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:37,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:37,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:37,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:39,884 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (mod main_~index~0 2) (select (select |v_#memory_int_21| |main_~#array~0.base|) (+ (* 4 (mod (+ v_prenex_29 4294967295) 4294967296)) |main_~#array~0.offset|))) [2019-09-03 19:45:41,930 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (mod main_~index~0 2) (select (select |v_#memory_int_21| |main_~#array~0.base|) (+ (* 4 (mod (+ v_prenex_29 4294967294) 4294967296)) |main_~#array~0.offset|))) [2019-09-03 19:45:41,982 INFO L235 Elim1Store]: Index analysis took 6315 ms [2019-09-03 19:45:44,041 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (mod main_~index~0 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod v_prenex_29 4294967296)) |main_~#array~0.offset|))) [2019-09-03 19:45:49,857 WARN L188 SmtUtils]: Spent 5.80 s on a formula simplification that was a NOOP. DAG size: 64 [2019-09-03 19:45:49,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:45:49,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 330 [2019-09-03 19:45:49,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:49,866 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:49,867 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:49,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:49,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:49,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:49,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:49,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:49,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:49,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:49,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:49,986 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:45:49,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 221 [2019-09-03 19:45:49,988 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:49,998 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:49,999 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:50,005 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:50,006 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:50,011 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:50,011 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:57,043 WARN L188 SmtUtils]: Spent 7.03 s on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-09-03 19:45:57,044 INFO L567 ElimStorePlain]: treesize reduction 431, result has 18.4 percent of original size [2019-09-03 19:45:57,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:45:57,045 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:691, output treesize:97 [2019-09-03 19:45:57,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:57,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:57,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:45:57,180 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:45:57,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:45:57,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:57,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:57,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:57,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:57,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:57,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:59,313 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (+ (* 4 (mod (+ v_prenex_30 4294967294) 4294967296)) |main_~#array~0.offset|) (+ (* 4 (mod (+ v_prenex_30 4294967293) 4294967296)) |main_~#array~0.offset|)) [2019-09-03 19:45:59,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:45:59,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:46:01,363 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |v_#memory_int_22| |main_~#array~0.base|))) (= (select .cse0 (+ (* 4 (mod (+ v_prenex_30 4294967294) 4294967296)) |main_~#array~0.offset|)) (select .cse0 (+ (* 4 (mod (+ v_prenex_30 4294967295) 4294967296)) |main_~#array~0.offset|)))) [2019-09-03 19:46:03,451 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |v_#memory_int_22| |main_~#array~0.base|))) (= (select .cse0 (+ (* 4 (mod v_prenex_30 4294967296)) |main_~#array~0.offset|)) (select .cse0 (+ (* 4 (mod (+ v_prenex_30 4294967293) 4294967296)) |main_~#array~0.offset|)))) [2019-09-03 19:46:03,536 INFO L235 Elim1Store]: Index analysis took 6325 ms [2019-09-03 19:46:05,545 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ v_prenex_30 4294967295) 4294967296)) |main_~#array~0.offset|))) [2019-09-03 19:46:05,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:46:05,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 221 [2019-09-03 19:46:05,691 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:05,696 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:46:05,696 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:05,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:46:05,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:46:05,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:46:05,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:46:05,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:46:05,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:46:07,767 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (mod main_~index~0 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod (+ v_prenex_30 4294967295) 4294967296)) |main_~#array~0.offset|))) [2019-09-03 19:46:18,574 WARN L188 SmtUtils]: Spent 10.80 s on a formula simplification that was a NOOP. DAG size: 64 [2019-09-03 19:46:18,574 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:46:18,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 330 [2019-09-03 19:46:18,576 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:18,580 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:46:18,581 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:18,587 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:46:18,587 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-03 19:46:35,124 WARN L188 SmtUtils]: Spent 16.54 s on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-03 19:46:35,125 INFO L567 ElimStorePlain]: treesize reduction 395, result has 25.2 percent of original size [2019-09-03 19:46:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:35,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:35,127 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-03 19:46:35,127 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:691, output treesize:133 [2019-09-03 19:46:35,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:35,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:35,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:35,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:35,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:35,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:46:42,304 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-03 19:46:44,315 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_30 Int)) (let ((.cse1 (mod v_prenex_30 2)) (.cse2 (mod (+ v_prenex_30 1) 2)) (.cse0 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (= (select .cse0 (+ (* 4 (mod v_prenex_30 4294967296)) |c_main_~#array~0.offset|)) .cse1) (<= 6 v_prenex_30) (<= v_prenex_30 6) (= .cse2 (select .cse0 (+ (* 4 (mod (+ v_prenex_30 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse0 (+ (* 4 (mod (+ v_prenex_30 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse1) (= .cse2 (select .cse0 (+ (* 4 (mod (+ v_prenex_30 4294967295) 4294967296)) |c_main_~#array~0.offset|)))))) (exists ((main_~index~0 Int)) (let ((.cse3 (mod (+ main_~index~0 4294967295) 4294967296))) (and (= (mod (+ main_~index~0 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse3) |c_main_~#array~0.offset|))) (< .cse3 1000) (<= 1000 (mod main_~index~0 4294967296)))))) is different from false [2019-09-03 19:46:52,807 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 62 [2019-09-03 19:47:00,088 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#array~0.base_BEFORE_CALL_10| Int) (v_prenex_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_10| Int) (v_prenex_31 Int)) (let ((.cse2 (mod (+ v_prenex_30 1) 2)) (.cse1 (mod (+ v_prenex_31 4294967295) 4294967296)) (.cse0 (select |c_#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|)) (.cse3 (mod v_prenex_30 2))) (and (= (mod (+ v_prenex_31 1) 2) (select .cse0 (+ (* 4 .cse1) |v_main_~#array~0.offset_BEFORE_CALL_10|))) (= .cse2 (select .cse0 (+ (* 4 (mod (+ v_prenex_30 4294967295) 4294967296)) |v_main_~#array~0.offset_BEFORE_CALL_10|))) (<= 6 v_prenex_30) (<= v_prenex_30 6) (= .cse2 (select .cse0 (+ (* 4 (mod (+ v_prenex_30 4294967293) 4294967296)) |v_main_~#array~0.offset_BEFORE_CALL_10|))) (< .cse1 1000) (= (select .cse0 (+ (* 4 (mod v_prenex_30 4294967296)) |v_main_~#array~0.offset_BEFORE_CALL_10|)) .cse3) (<= 1000 (mod v_prenex_31 4294967296)) (= (select .cse0 (+ |v_main_~#array~0.offset_BEFORE_CALL_10| (* 4 (mod (+ v_prenex_30 4294967294) 4294967296)))) .cse3)))) (= 0 c_main_~index~0) (exists ((v_prenex_33 Int)) (let ((.cse4 (mod (+ v_prenex_33 4294967295) 4294967296))) (and (< .cse4 1000) (= (mod (+ v_prenex_33 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse4) |c_main_~#array~0.offset|))) (<= 1000 (mod v_prenex_33 4294967296))))) (exists ((v_prenex_32 Int)) (let ((.cse7 (mod v_prenex_32 2)) (.cse5 (mod (+ v_prenex_32 1) 2)) (.cse6 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (= .cse5 (select .cse6 (+ (* 4 (mod (+ v_prenex_32 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse6 (+ (* 4 (mod (+ v_prenex_32 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse7) (<= 6 v_prenex_32) (= (select .cse6 (+ (* 4 (mod v_prenex_32 4294967296)) |c_main_~#array~0.offset|)) .cse7) (= .cse5 (select .cse6 (+ (* 4 (mod (+ v_prenex_32 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (<= v_prenex_32 6))))) is different from false [2019-09-03 19:47:22,266 WARN L188 SmtUtils]: Spent 14.19 s on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2019-09-03 19:47:24,301 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (mod c_main_~index~0 2))) (let ((.cse2 (not (= (mod (+ .cse10 4294967294) 4294967296) 0))) (.cse0 (= 1 c_main_~index~0)) (.cse1 (mod c_main_~index~0 4294967296)) (.cse3 (not (= .cse10 0))) (.cse4 (exists ((v_prenex_33 Int)) (let ((.cse9 (mod (+ v_prenex_33 4294967295) 4294967296))) (and (< .cse9 1000) (= (mod (+ v_prenex_33 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse9) |c_main_~#array~0.offset|))) (<= 1000 (mod v_prenex_33 4294967296)))))) (.cse5 (exists ((v_prenex_32 Int)) (let ((.cse8 (mod v_prenex_32 2)) (.cse6 (mod (+ v_prenex_32 1) 2)) (.cse7 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (= .cse6 (select .cse7 (+ (* 4 (mod (+ v_prenex_32 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse7 (+ (* 4 (mod (+ v_prenex_32 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse8) (<= 6 v_prenex_32) (= (select .cse7 (+ (* 4 (mod v_prenex_32 4294967296)) |c_main_~#array~0.offset|)) .cse8) (= .cse6 (select .cse7 (+ (* 4 (mod (+ v_prenex_32 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (<= v_prenex_32 6)))))) (or (and .cse0 (< .cse1 0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse0 (<= 0 .cse1) .cse3 .cse4 .cse5)))) is different from false [2019-09-03 19:47:49,178 WARN L838 $PredicateComparison]: unable to prove that (and (= 2 c_main_~index~0) (< (mod c_main_~index~0 4294967296) 1000) (exists ((v_prenex_33 Int)) (let ((.cse0 (mod (+ v_prenex_33 4294967295) 4294967296))) (and (< .cse0 1000) (= (mod (+ v_prenex_33 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse0) |c_main_~#array~0.offset|))) (<= 1000 (mod v_prenex_33 4294967296))))) (exists ((v_prenex_32 Int)) (let ((.cse3 (mod v_prenex_32 2)) (.cse1 (mod (+ v_prenex_32 1) 2)) (.cse2 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (= .cse1 (select .cse2 (+ (* 4 (mod (+ v_prenex_32 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse2 (+ (* 4 (mod (+ v_prenex_32 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse3) (<= 6 v_prenex_32) (= (select .cse2 (+ (* 4 (mod v_prenex_32 4294967296)) |c_main_~#array~0.offset|)) .cse3) (= .cse1 (select .cse2 (+ (* 4 (mod (+ v_prenex_32 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (<= v_prenex_32 6))))) is different from false [2019-09-03 19:48:20,891 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 62 [2019-09-03 19:48:22,730 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2019-09-03 19:48:22,731 INFO L341 Elim1Store]: treesize reduction 138, result has 57.0 percent of original size [2019-09-03 19:48:22,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 217 [2019-09-03 19:48:22,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:48:23,218 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 20 [2019-09-03 19:48:23,218 INFO L567 ElimStorePlain]: treesize reduction 219, result has 10.6 percent of original size [2019-09-03 19:48:23,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:48:23,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:117, output treesize:14 [2019-09-03 19:48:29,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:48:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 92 refuted. 2 times theorem prover too weak. 14 trivial. 7 not checked. [2019-09-03 19:48:35,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:48:35,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 27] total 33 [2019-09-03 19:48:35,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:48:35,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:48:35,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=702, Unknown=21, NotChecked=228, Total=1056 [2019-09-03 19:48:35,705 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 33 states. [2019-09-03 19:48:41,725 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-03 19:48:44,664 WARN L188 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-03 19:48:49,472 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-09-03 19:48:52,174 WARN L188 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-03 19:49:03,434 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~index~0 4294967295) 4294967296))) (and (= (mod (+ c_main_~index~0 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse0) |c_main_~#array~0.offset|))) (exists ((|v_main_~#array~0.base_BEFORE_CALL_10| Int) (v_prenex_30 Int) (|v_main_~#array~0.offset_BEFORE_CALL_10| Int) (v_prenex_31 Int)) (let ((.cse3 (mod (+ v_prenex_30 1) 2)) (.cse2 (mod (+ v_prenex_31 4294967295) 4294967296)) (.cse1 (select |c_#memory_int| |v_main_~#array~0.base_BEFORE_CALL_10|)) (.cse4 (mod v_prenex_30 2))) (and (= (mod (+ v_prenex_31 1) 2) (select .cse1 (+ (* 4 .cse2) |v_main_~#array~0.offset_BEFORE_CALL_10|))) (= .cse3 (select .cse1 (+ (* 4 (mod (+ v_prenex_30 4294967295) 4294967296)) |v_main_~#array~0.offset_BEFORE_CALL_10|))) (<= 6 v_prenex_30) (<= v_prenex_30 6) (= .cse3 (select .cse1 (+ (* 4 (mod (+ v_prenex_30 4294967293) 4294967296)) |v_main_~#array~0.offset_BEFORE_CALL_10|))) (< .cse2 1000) (= (select .cse1 (+ (* 4 (mod v_prenex_30 4294967296)) |v_main_~#array~0.offset_BEFORE_CALL_10|)) .cse4) (<= 1000 (mod v_prenex_31 4294967296)) (= (select .cse1 (+ |v_main_~#array~0.offset_BEFORE_CALL_10| (* 4 (mod (+ v_prenex_30 4294967294) 4294967296)))) .cse4)))) (< .cse0 1000) (exists ((v_prenex_30 Int)) (let ((.cse6 (mod v_prenex_30 2)) (.cse7 (mod (+ v_prenex_30 1) 2)) (.cse5 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (= (select .cse5 (+ (* 4 (mod v_prenex_30 4294967296)) |c_main_~#array~0.offset|)) .cse6) (<= 6 v_prenex_30) (<= v_prenex_30 6) (= .cse7 (select .cse5 (+ (* 4 (mod (+ v_prenex_30 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse5 (+ (* 4 (mod (+ v_prenex_30 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse6) (= .cse7 (select .cse5 (+ (* 4 (mod (+ v_prenex_30 4294967295) 4294967296)) |c_main_~#array~0.offset|)))))) (exists ((main_~index~0 Int)) (let ((.cse8 (mod (+ main_~index~0 4294967295) 4294967296))) (and (= (mod (+ main_~index~0 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse8) |c_main_~#array~0.offset|))) (< .cse8 1000) (<= 1000 (mod main_~index~0 4294967296))))) (exists ((main_~index~0 Int)) (let ((.cse9 (mod main_~index~0 2)) (.cse10 (select |c_#memory_int| |c_main_~#array~0.base|)) (.cse11 (mod (+ main_~index~0 1) 2))) (and (= .cse9 (select .cse10 (+ (* 4 (mod main_~index~0 4294967296)) |c_main_~#array~0.offset|))) (= .cse11 (select .cse10 (+ (* 4 (mod (+ main_~index~0 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (= .cse9 (select .cse10 (+ (* 4 (mod (+ main_~index~0 4294967294) 4294967296)) |c_main_~#array~0.offset|))) (<= 6 main_~index~0) (= (select .cse10 (+ (* 4 (mod (+ main_~index~0 4294967293) 4294967296)) |c_main_~#array~0.offset|)) .cse11) (<= main_~index~0 6)))))) is different from false [2019-09-03 19:49:10,032 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 1 c_main_~index~0)) (.cse4 (exists ((v_prenex_33 Int)) (let ((.cse10 (mod (+ v_prenex_33 4294967295) 4294967296))) (and (< .cse10 1000) (= (mod (+ v_prenex_33 1) 2) (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse10) |c_main_~#array~0.offset|))) (<= 1000 (mod v_prenex_33 4294967296)))))) (.cse5 (exists ((v_prenex_32 Int)) (let ((.cse9 (mod v_prenex_32 2)) (.cse7 (mod (+ v_prenex_32 1) 2)) (.cse8 (select |c_#memory_int| |c_main_~#array~0.base|))) (and (= .cse7 (select .cse8 (+ (* 4 (mod (+ v_prenex_32 4294967293) 4294967296)) |c_main_~#array~0.offset|))) (= (select .cse8 (+ (* 4 (mod (+ v_prenex_32 4294967294) 4294967296)) |c_main_~#array~0.offset|)) .cse9) (<= 6 v_prenex_32) (= (select .cse8 (+ (* 4 (mod v_prenex_32 4294967296)) |c_main_~#array~0.offset|)) .cse9) (= .cse7 (select .cse8 (+ (* 4 (mod (+ v_prenex_32 4294967295) 4294967296)) |c_main_~#array~0.offset|))) (<= v_prenex_32 6)))))) (and .cse0 (let ((.cse6 (mod c_main_~index~0 2))) (let ((.cse2 (not (= (mod (+ .cse6 4294967294) 4294967296) 0))) (.cse1 (mod c_main_~index~0 4294967296)) (.cse3 (not (= .cse6 0)))) (or (and .cse0 (< .cse1 0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse0 (<= 0 .cse1) .cse3 .cse4 .cse5)))) .cse4 .cse5)) is different from false [2019-09-03 19:49:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:22,614 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2019-09-03 19:49:22,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:49:22,617 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2019-09-03 19:49:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:22,618 INFO L225 Difference]: With dead ends: 158 [2019-09-03 19:49:22,619 INFO L226 Difference]: Without dead ends: 95 [2019-09-03 19:49:22,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 140.1s TimeCoverageRelationStatistics Valid=169, Invalid=1161, Unknown=26, NotChecked=450, Total=1806 [2019-09-03 19:49:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-03 19:49:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-09-03 19:49:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-03 19:49:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2019-09-03 19:49:22,638 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 59 [2019-09-03 19:49:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:22,638 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2019-09-03 19:49:22,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:49:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2019-09-03 19:49:22,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 19:49:22,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:22,641 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:22,641 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:22,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:22,641 INFO L82 PathProgramCache]: Analyzing trace with hash -460428553, now seen corresponding path program 7 times [2019-09-03 19:49:22,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:22,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:22,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:22,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:22,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 8 proven. 100 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:49:22,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:22,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:22,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:22,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:49:22,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:49:22,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:22,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-03 19:49:22,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:49:22,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:49:22,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:49:22,912 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 14 states. [2019-09-03 19:49:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:23,449 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2019-09-03 19:49:23,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:49:23,450 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-09-03 19:49:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:23,451 INFO L225 Difference]: With dead ends: 182 [2019-09-03 19:49:23,451 INFO L226 Difference]: Without dead ends: 115 [2019-09-03 19:49:23,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:49:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-03 19:49:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-09-03 19:49:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 19:49:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2019-09-03 19:49:23,467 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 70 [2019-09-03 19:49:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:23,468 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2019-09-03 19:49:23,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:49:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2019-09-03 19:49:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:49:23,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:23,469 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:23,469 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:23,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:23,470 INFO L82 PathProgramCache]: Analyzing trace with hash -892250791, now seen corresponding path program 8 times [2019-09-03 19:49:23,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:23,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:23,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:23,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:23,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 8 proven. 121 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:49:23,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:23,683 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-03 19:49:23,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:49:23,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:49:23,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:23,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:49:23,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:49:23,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:23,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-03 19:49:23,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:49:23,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:49:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:49:23,776 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 15 states. [2019-09-03 19:49:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:24,417 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2019-09-03 19:49:24,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:49:24,418 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-09-03 19:49:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:24,419 INFO L225 Difference]: With dead ends: 204 [2019-09-03 19:49:24,419 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 19:49:24,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:49:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 19:49:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2019-09-03 19:49:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-03 19:49:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2019-09-03 19:49:24,446 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 72 [2019-09-03 19:49:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:24,446 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2019-09-03 19:49:24,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:49:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2019-09-03 19:49:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 19:49:24,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:24,448 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:24,448 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:24,449 INFO L82 PathProgramCache]: Analyzing trace with hash 738406203, now seen corresponding path program 9 times [2019-09-03 19:49:24,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:24,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:24,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:24,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:24,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 8 proven. 144 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:49:24,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:24,811 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) [2019-09-03 19:49:24,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:28,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 19:49:28,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:28,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:49:28,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:49:28,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:28,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-03 19:49:28,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:49:28,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:49:28,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:49:28,500 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 16 states. [2019-09-03 19:49:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:29,295 INFO L93 Difference]: Finished difference Result 216 states and 239 transitions. [2019-09-03 19:49:29,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:49:29,295 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-09-03 19:49:29,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:29,297 INFO L225 Difference]: With dead ends: 216 [2019-09-03 19:49:29,297 INFO L226 Difference]: Without dead ends: 129 [2019-09-03 19:49:29,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:49:29,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-03 19:49:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2019-09-03 19:49:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-03 19:49:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2019-09-03 19:49:29,315 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 74 [2019-09-03 19:49:29,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:29,315 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2019-09-03 19:49:29,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:49:29,315 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2019-09-03 19:49:29,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 19:49:29,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:29,316 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:29,316 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:29,317 INFO L82 PathProgramCache]: Analyzing trace with hash 136714397, now seen corresponding path program 10 times [2019-09-03 19:49:29,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:29,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:29,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:29,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 8 proven. 169 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:49:29,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:29,548 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) [2019-09-03 19:49:29,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:29,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:49:29,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:29,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:49:29,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:49:29,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:29,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-03 19:49:29,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:49:29,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:49:29,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:49:29,667 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand 17 states. [2019-09-03 19:49:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:30,550 INFO L93 Difference]: Finished difference Result 228 states and 253 transitions. [2019-09-03 19:49:30,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:49:30,551 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-09-03 19:49:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:30,553 INFO L225 Difference]: With dead ends: 228 [2019-09-03 19:49:30,553 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 19:49:30,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:49:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 19:49:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2019-09-03 19:49:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 19:49:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2019-09-03 19:49:30,572 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 76 [2019-09-03 19:49:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:30,572 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2019-09-03 19:49:30,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:49:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2019-09-03 19:49:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 19:49:30,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:30,573 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:30,573 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:30,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:30,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1731473791, now seen corresponding path program 11 times [2019-09-03 19:49:30,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:30,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:30,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:30,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:30,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 8 proven. 196 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:49:30,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:30,878 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) [2019-09-03 19:49:30,891 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:56,469 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-09-03 19:50:56,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:56,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:50:56,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:50:56,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:56,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-03 19:50:56,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:50:56,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:50:56,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:50:56,530 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 18 states. [2019-09-03 19:50:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:57,543 INFO L93 Difference]: Finished difference Result 240 states and 267 transitions. [2019-09-03 19:50:57,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:50:57,550 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-09-03 19:50:57,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:57,551 INFO L225 Difference]: With dead ends: 240 [2019-09-03 19:50:57,551 INFO L226 Difference]: Without dead ends: 143 [2019-09-03 19:50:57,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:50:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-03 19:50:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2019-09-03 19:50:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 19:50:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2019-09-03 19:50:57,575 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 78 [2019-09-03 19:50:57,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:57,575 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2019-09-03 19:50:57,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:50:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2019-09-03 19:50:57,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:50:57,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:57,576 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:57,576 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:57,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:57,576 INFO L82 PathProgramCache]: Analyzing trace with hash 991926753, now seen corresponding path program 12 times [2019-09-03 19:50:57,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:57,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:57,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:57,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 8 proven. 225 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:50:57,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:57,861 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-03 19:50:57,872 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:50,239 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-03 19:51:50,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:50,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:51:50,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:51:50,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:50,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-03 19:51:50,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:51:50,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:51:50,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:51:50,330 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand 19 states. [2019-09-03 19:51:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:51,422 INFO L93 Difference]: Finished difference Result 252 states and 281 transitions. [2019-09-03 19:51:51,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:51:51,426 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 80 [2019-09-03 19:51:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:51,427 INFO L225 Difference]: With dead ends: 252 [2019-09-03 19:51:51,427 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 19:51:51,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:51:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 19:51:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-09-03 19:51:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-03 19:51:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2019-09-03 19:51:51,445 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 80 [2019-09-03 19:51:51,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:51,446 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2019-09-03 19:51:51,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:51:51,446 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2019-09-03 19:51:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 19:51:51,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:51,447 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:51,447 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:51,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:51,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1043172925, now seen corresponding path program 13 times [2019-09-03 19:51:51,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:51,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:51,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:51,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:51,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 8 proven. 256 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:51:51,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:51,750 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-03 19:51:51,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:51,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:51:51,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:51:51,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:51,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-03 19:51:51,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:51:51,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:51:51,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:51:51,849 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand 20 states. [2019-09-03 19:51:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:53,100 INFO L93 Difference]: Finished difference Result 264 states and 295 transitions. [2019-09-03 19:51:53,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:51:53,101 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2019-09-03 19:51:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:53,102 INFO L225 Difference]: With dead ends: 264 [2019-09-03 19:51:53,102 INFO L226 Difference]: Without dead ends: 157 [2019-09-03 19:51:53,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:51:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-03 19:51:53,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-09-03 19:51:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-03 19:51:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2019-09-03 19:51:53,123 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 82 [2019-09-03 19:51:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:53,124 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2019-09-03 19:51:53,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:51:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2019-09-03 19:51:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 19:51:53,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:53,125 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:53,125 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1731123493, now seen corresponding path program 14 times [2019-09-03 19:51:53,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:53,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:53,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:53,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:53,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 8 proven. 289 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:51:53,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:53,452 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-03 19:51:53,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:53,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:53,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:53,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:51:53,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:51:53,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:53,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-03 19:51:53,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:51:53,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:51:53,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:51:53,553 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand 21 states. [2019-09-03 19:51:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:54,957 INFO L93 Difference]: Finished difference Result 276 states and 309 transitions. [2019-09-03 19:51:54,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:51:54,957 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2019-09-03 19:51:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:54,959 INFO L225 Difference]: With dead ends: 276 [2019-09-03 19:51:54,959 INFO L226 Difference]: Without dead ends: 164 [2019-09-03 19:51:54,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:51:54,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-03 19:51:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2019-09-03 19:51:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:51:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-03 19:51:54,991 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 84 [2019-09-03 19:51:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:54,991 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-03 19:51:54,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:51:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-03 19:51:54,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 19:51:54,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:54,992 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:54,992 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:54,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:54,993 INFO L82 PathProgramCache]: Analyzing trace with hash 655290375, now seen corresponding path program 15 times [2019-09-03 19:51:54,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:54,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:54,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:54,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:54,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 8 proven. 324 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:51:55,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:55,411 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-03 19:51:55,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:14,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 19:52:14,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:14,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:52:14,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:52:14,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:14,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-03 19:52:14,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:52:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:52:14,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:52:14,883 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 22 states. [2019-09-03 19:52:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:16,436 INFO L93 Difference]: Finished difference Result 288 states and 323 transitions. [2019-09-03 19:52:16,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:52:16,436 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2019-09-03 19:52:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:16,438 INFO L225 Difference]: With dead ends: 288 [2019-09-03 19:52:16,438 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 19:52:16,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:52:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 19:52:16,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-09-03 19:52:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 19:52:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2019-09-03 19:52:16,461 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 86 [2019-09-03 19:52:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:16,462 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2019-09-03 19:52:16,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:52:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2019-09-03 19:52:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:52:16,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:16,463 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:16,463 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1866782313, now seen corresponding path program 16 times [2019-09-03 19:52:16,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:16,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:16,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:16,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:16,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 8 proven. 361 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:52:16,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:16,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:16,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:16,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:16,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:16,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:52:16,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:52:17,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:17,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-03 19:52:17,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:52:17,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:52:17,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:52:17,044 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand 23 states. [2019-09-03 19:52:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:18,690 INFO L93 Difference]: Finished difference Result 300 states and 337 transitions. [2019-09-03 19:52:18,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:52:18,690 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 88 [2019-09-03 19:52:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:18,692 INFO L225 Difference]: With dead ends: 300 [2019-09-03 19:52:18,692 INFO L226 Difference]: Without dead ends: 178 [2019-09-03 19:52:18,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:52:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-03 19:52:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2019-09-03 19:52:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-03 19:52:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 192 transitions. [2019-09-03 19:52:18,715 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 192 transitions. Word has length 88 [2019-09-03 19:52:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:18,716 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 192 transitions. [2019-09-03 19:52:18,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:52:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 192 transitions. [2019-09-03 19:52:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-03 19:52:18,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:18,717 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:18,717 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:18,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:18,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2120569781, now seen corresponding path program 17 times [2019-09-03 19:52:18,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:18,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:18,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:18,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:18,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 8 proven. 400 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:52:19,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:19,201 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-03 19:52:19,222 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:00,874 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-09-03 19:55:00,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:00,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:55:00,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:55:00,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:00,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-03 19:55:00,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:55:00,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:55:00,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:55:00,956 INFO L87 Difference]: Start difference. First operand 174 states and 192 transitions. Second operand 24 states. [2019-09-03 19:55:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:02,849 INFO L93 Difference]: Finished difference Result 312 states and 351 transitions. [2019-09-03 19:55:02,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:55:02,850 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2019-09-03 19:55:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:02,851 INFO L225 Difference]: With dead ends: 312 [2019-09-03 19:55:02,852 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 19:55:02,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:55:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 19:55:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2019-09-03 19:55:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-03 19:55:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 200 transitions. [2019-09-03 19:55:02,874 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 200 transitions. Word has length 90 [2019-09-03 19:55:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:02,874 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 200 transitions. [2019-09-03 19:55:02,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:55:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 200 transitions. [2019-09-03 19:55:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 19:55:02,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:02,875 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:02,875 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:02,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1439863213, now seen corresponding path program 18 times [2019-09-03 19:55:02,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:02,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:02,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:02,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:02,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 8 proven. 441 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:55:03,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:03,260 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-03 19:55:03,271 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:26,212 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-03 19:56:26,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:26,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:56:26,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:56:26,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:26,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-03 19:56:26,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:56:26,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:56:26,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:56:26,304 INFO L87 Difference]: Start difference. First operand 181 states and 200 transitions. Second operand 25 states. [2019-09-03 19:56:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:28,333 INFO L93 Difference]: Finished difference Result 324 states and 365 transitions. [2019-09-03 19:56:28,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:56:28,336 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2019-09-03 19:56:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:28,338 INFO L225 Difference]: With dead ends: 324 [2019-09-03 19:56:28,338 INFO L226 Difference]: Without dead ends: 192 [2019-09-03 19:56:28,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:56:28,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-03 19:56:28,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2019-09-03 19:56:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-03 19:56:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 208 transitions. [2019-09-03 19:56:28,364 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 208 transitions. Word has length 92 [2019-09-03 19:56:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:28,365 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 208 transitions. [2019-09-03 19:56:28,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:56:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 208 transitions. [2019-09-03 19:56:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 19:56:28,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:28,366 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:28,366 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:28,367 INFO L82 PathProgramCache]: Analyzing trace with hash -72964465, now seen corresponding path program 19 times [2019-09-03 19:56:28,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:28,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:28,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:28,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:28,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 8 proven. 484 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:56:28,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:28,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:28,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:28,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:56:28,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:56:28,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:28,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-03 19:56:28,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:56:28,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:56:28,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:56:28,952 INFO L87 Difference]: Start difference. First operand 188 states and 208 transitions. Second operand 26 states. [2019-09-03 19:56:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:31,175 INFO L93 Difference]: Finished difference Result 336 states and 379 transitions. [2019-09-03 19:56:31,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:56:31,175 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 94 [2019-09-03 19:56:31,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:31,177 INFO L225 Difference]: With dead ends: 336 [2019-09-03 19:56:31,177 INFO L226 Difference]: Without dead ends: 199 [2019-09-03 19:56:31,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:56:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-03 19:56:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2019-09-03 19:56:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-03 19:56:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2019-09-03 19:56:31,208 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 94 [2019-09-03 19:56:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:31,208 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2019-09-03 19:56:31,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:56:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2019-09-03 19:56:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:56:31,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:31,209 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:31,209 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:31,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:31,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2093550321, now seen corresponding path program 20 times [2019-09-03 19:56:31,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:31,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:31,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:31,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:31,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 8 proven. 529 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:56:31,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:31,661 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-03 19:56:31,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:31,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:31,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:31,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:56:31,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:56:31,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:31,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-03 19:56:31,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:56:31,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:56:31,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:56:31,797 INFO L87 Difference]: Start difference. First operand 195 states and 216 transitions. Second operand 27 states. [2019-09-03 19:56:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:34,204 INFO L93 Difference]: Finished difference Result 348 states and 393 transitions. [2019-09-03 19:56:34,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:56:34,205 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 96 [2019-09-03 19:56:34,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:34,206 INFO L225 Difference]: With dead ends: 348 [2019-09-03 19:56:34,206 INFO L226 Difference]: Without dead ends: 206 [2019-09-03 19:56:34,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:56:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-03 19:56:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 202. [2019-09-03 19:56:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-03 19:56:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2019-09-03 19:56:34,234 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 96 [2019-09-03 19:56:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:34,234 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2019-09-03 19:56:34,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:56:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2019-09-03 19:56:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 19:56:34,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:34,237 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:34,237 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:34,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1055121107, now seen corresponding path program 21 times [2019-09-03 19:56:34,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:34,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:34,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 8 proven. 576 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:56:34,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:34,730 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-03 19:56:34,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:58:40,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-09-03 19:58:40,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:41,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:58:41,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:58:41,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:41,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-03 19:58:41,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:58:41,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:58:41,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:58:41,223 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand 28 states. [2019-09-03 19:58:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:43,875 INFO L93 Difference]: Finished difference Result 360 states and 407 transitions. [2019-09-03 19:58:43,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:58:43,876 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 98 [2019-09-03 19:58:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:43,878 INFO L225 Difference]: With dead ends: 360 [2019-09-03 19:58:43,878 INFO L226 Difference]: Without dead ends: 213 [2019-09-03 19:58:43,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:58:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-03 19:58:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2019-09-03 19:58:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-03 19:58:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 232 transitions. [2019-09-03 19:58:43,905 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 232 transitions. Word has length 98 [2019-09-03 19:58:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:43,905 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 232 transitions. [2019-09-03 19:58:43,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:58:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 232 transitions. [2019-09-03 19:58:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 19:58:43,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:43,906 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:43,907 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:43,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:43,907 INFO L82 PathProgramCache]: Analyzing trace with hash -442940875, now seen corresponding path program 22 times [2019-09-03 19:58:43,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:43,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:43,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:43,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:43,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 8 proven. 625 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:58:44,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:44,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:58:44,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:58:44,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:58:44,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:44,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:58:44,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:58:44,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:44,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-03 19:58:44,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:58:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:58:44,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:58:44,672 INFO L87 Difference]: Start difference. First operand 209 states and 232 transitions. Second operand 29 states.