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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/phases_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:38:21,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:38:21,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:38:21,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:38:21,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:38:21,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:38:21,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:38:21,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:38:21,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:38:21,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:38:21,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:38:21,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:38:21,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:38:21,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:38:21,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:38:21,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:38:21,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:38:21,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:38:21,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:38:21,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:38:21,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:38:21,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:38:21,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:38:21,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:38:21,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:38:21,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:38:21,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:38:21,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:38:21,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:38:21,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:38:21,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:38:21,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:38:21,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:38:21,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:38:21,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:38:21,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:38:21,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:38:21,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:38:21,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:38:21,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:38:21,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:38:21,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:38:21,229 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:38:21,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:38:21,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:38:21,230 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:38:21,230 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:38:21,231 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:38:21,231 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:38:21,231 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:38:21,231 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:38:21,231 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:38:21,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:38:21,232 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:38:21,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:38:21,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:38:21,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:38:21,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:38:21,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:38:21,233 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:38:21,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:38:21,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:38:21,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:38:21,234 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:38:21,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:38:21,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:38:21,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:38:21,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:38:21,235 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:38:21,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:38:21,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:38:21,236 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:38:21,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:38:21,283 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:38:21,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:38:21,290 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:38:21,290 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:38:21,291 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2019-09-03 20:38:21,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c17796a5/1833a0dde6e94a538d1fba8946af5f90/FLAG7be0be6ac [2019-09-03 20:38:21,778 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:38:21,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2019-09-03 20:38:21,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c17796a5/1833a0dde6e94a538d1fba8946af5f90/FLAG7be0be6ac [2019-09-03 20:38:22,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c17796a5/1833a0dde6e94a538d1fba8946af5f90 [2019-09-03 20:38:22,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:38:22,191 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:38:22,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:38:22,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:38:22,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:38:22,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:38:22" (1/1) ... [2019-09-03 20:38:22,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5748c03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:38:22, skipping insertion in model container [2019-09-03 20:38:22,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:38:22" (1/1) ... [2019-09-03 20:38:22,206 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:38:22,220 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:38:22,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:38:22,394 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:38:22,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:38:22,419 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:38:22,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:38:22 WrapperNode [2019-09-03 20:38:22,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:38:22,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:38:22,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:38:22,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:38:22,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:38:22" (1/1) ... [2019-09-03 20:38:22,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:38:22" (1/1) ... [2019-09-03 20:38:22,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:38:22" (1/1) ... [2019-09-03 20:38:22,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:38:22" (1/1) ... [2019-09-03 20:38:22,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:38:22" (1/1) ... [2019-09-03 20:38:22,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:38:22" (1/1) ... [2019-09-03 20:38:22,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:38:22" (1/1) ... [2019-09-03 20:38:22,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:38:22,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:38:22,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:38:22,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:38:22,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:38:22" (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 20:38:22,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:38:22,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:38:22,590 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:38:22,590 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:38:22,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:38:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:38:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:38:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:38:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:38:22,743 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:38:22,743 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:38:22,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:38:22 BoogieIcfgContainer [2019-09-03 20:38:22,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:38:22,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:38:22,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:38:22,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:38:22,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:38:22" (1/3) ... [2019-09-03 20:38:22,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc02600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:38:22, skipping insertion in model container [2019-09-03 20:38:22,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:38:22" (2/3) ... [2019-09-03 20:38:22,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc02600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:38:22, skipping insertion in model container [2019-09-03 20:38:22,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:38:22" (3/3) ... [2019-09-03 20:38:22,751 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2019-09-03 20:38:22,760 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:38:22,766 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:38:22,782 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:38:22,810 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:38:22,810 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:38:22,810 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:38:22,810 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:38:22,810 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:38:22,811 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:38:22,811 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:38:22,811 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:38:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-03 20:38:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:38:22,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:22,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:22,840 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:22,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:22,846 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-03 20:38:22,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:22,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:22,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:22,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:22,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:22,944 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 20:38:22,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:38:22,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:38:22,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:38:22,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:38:22,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:38:22,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:38:22,963 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-03 20:38:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:22,978 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-09-03 20:38:22,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:38:22,979 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:38:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:22,987 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:38:22,987 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 20:38:22,988 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 20:38:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 20:38:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 20:38:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 20:38:23,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-03 20:38:23,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-03 20:38:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:23,022 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-03 20:38:23,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:38:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-03 20:38:23,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:38:23,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:23,023 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:23,023 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:23,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:23,024 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-03 20:38:23,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:23,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:23,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:23,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:23,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:23,188 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 20:38:23,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:38:23,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:38:23,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:38:23,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:38:23,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:38:23,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:38:23,198 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-03 20:38:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:23,222 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-09-03 20:38:23,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:38:23,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:38:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:23,224 INFO L225 Difference]: With dead ends: 14 [2019-09-03 20:38:23,224 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:38:23,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:38:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:38:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 20:38:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 20:38:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-03 20:38:23,233 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-03 20:38:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:23,234 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-03 20:38:23,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:38:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-03 20:38:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:38:23,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:23,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:23,235 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:23,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:23,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-03 20:38:23,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:23,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:23,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:23,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:23,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:23,347 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 20:38:23,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:23,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:23,349 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-03 20:38:23,351 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [25], [28], [30], [36], [37], [38], [40] [2019-09-03 20:38:23,387 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:38:23,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:38:23,450 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:38:24,001 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:38:24,004 INFO L272 AbstractInterpreter]: Visited 12 different actions 54 times. Merged at 3 different actions 18 times. Widened at 1 different actions 4 times. Performed 88 root evaluator evaluations with a maximum evaluation depth of 13. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-03 20:38:24,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:24,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:38:24,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:24,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 20:38:24,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:24,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:38:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:24,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:38:24,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:24,111 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 20:38:24,111 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:24,148 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 20:38:24,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:24,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-03 20:38:24,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:24,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:38:24,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:38:24,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:38:24,156 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-03 20:38:24,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:24,196 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-03 20:38:24,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:38:24,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 20:38:24,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:24,199 INFO L225 Difference]: With dead ends: 16 [2019-09-03 20:38:24,199 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:38:24,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:38:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:38:24,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 20:38:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 20:38:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-09-03 20:38:24,207 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-09-03 20:38:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:24,207 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-09-03 20:38:24,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:38:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-09-03 20:38:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:38:24,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:24,208 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:24,208 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:24,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:24,209 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-03 20:38:24,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:24,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:24,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:24,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:24,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:24,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:24,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:24,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:24,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:24,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:24,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:38:24,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:38:24,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:24,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:38:24,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:24,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:38:24,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 20:38:24,401 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 20:38:24,428 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:38:24,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-09-03 20:38:24,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:38:24,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:38:24,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:38:24,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:38:24,431 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2019-09-03 20:38:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:24,455 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-09-03 20:38:24,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:38:24,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-03 20:38:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:24,457 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:38:24,457 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:38:24,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:38:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:38:24,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-03 20:38:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:38:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 20:38:24,464 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-09-03 20:38:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:24,465 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 20:38:24,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:38:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 20:38:24,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:38:24,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:24,466 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:24,467 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:24,467 INFO L82 PathProgramCache]: Analyzing trace with hash -582276883, now seen corresponding path program 1 times [2019-09-03 20:38:24,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:24,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:24,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:24,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:24,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:24,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:24,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:24,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-03 20:38:24,583 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [25], [28], [30], [36], [37], [38], [40] [2019-09-03 20:38:24,587 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:38:24,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:38:24,591 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:38:24,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:38:24,808 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 18 times. Widened at 2 different actions 4 times. Performed 104 root evaluator evaluations with a maximum evaluation depth of 13. Performed 104 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 8 fixpoints after 2 different actions. Largest state had 2 variables. [2019-09-03 20:38:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:24,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:38:24,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:24,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:24,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:24,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:38:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:24,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:38:24,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:24,875 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:24,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:24,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2019-09-03 20:38:24,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:24,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:38:24,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:38:24,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:38:24,979 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-03 20:38:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:25,033 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 20:38:25,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:38:25,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-03 20:38:25,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:25,034 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:38:25,034 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:38:25,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:38:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:38:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 20:38:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:38:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-03 20:38:25,038 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-09-03 20:38:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:25,039 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-03 20:38:25,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:38:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-03 20:38:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:38:25,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:25,040 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:25,040 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash 719600874, now seen corresponding path program 2 times [2019-09-03 20:38:25,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:25,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:25,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:25,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:25,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:25,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:25,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:25,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:25,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:25,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:25,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 20:38:25,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:38:25,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:25,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:38:25,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:25,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:38:25,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:38:25,233 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:38:25,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:25,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2019-09-03 20:38:25,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:25,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:38:25,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:38:25,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:38:25,296 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 8 states. [2019-09-03 20:38:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:25,506 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-03 20:38:25,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:38:25,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-03 20:38:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:25,509 INFO L225 Difference]: With dead ends: 26 [2019-09-03 20:38:25,509 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:38:25,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:38:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:38:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-09-03 20:38:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:38:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-03 20:38:25,516 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-09-03 20:38:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:25,518 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-03 20:38:25,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:38:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-03 20:38:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:38:25,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:25,520 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:25,521 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 957312226, now seen corresponding path program 3 times [2019-09-03 20:38:25,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:25,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:25,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:25,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:25,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:38:25,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:25,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:25,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:25,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:25,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:25,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:25,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:38:25,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:38:25,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:38:25,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:25,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:38:25,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:38:25,756 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:38:25,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:25,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 14 [2019-09-03 20:38:25,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:25,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:38:25,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:38:25,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:38:25,968 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2019-09-03 20:38:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:26,043 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-03 20:38:26,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:38:26,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-09-03 20:38:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:26,045 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:38:26,045 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:38:26,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:38:26,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:38:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 20:38:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:38:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-03 20:38:26,049 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2019-09-03 20:38:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:26,050 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-03 20:38:26,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:38:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-03 20:38:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:38:26,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:26,051 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:26,051 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:26,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:26,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1915302113, now seen corresponding path program 4 times [2019-09-03 20:38:26,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:26,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:26,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:26,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:26,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:38:26,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:26,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:26,190 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:26,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:26,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:26,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 20:38:26,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:26,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:26,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:38:26,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:38:26,267 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:38:26,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:26,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-03 20:38:26,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:26,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:38:26,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:38:26,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:38:26,612 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 9 states. [2019-09-03 20:38:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:26,715 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-03 20:38:26,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:38:26,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-09-03 20:38:26,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:26,718 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:38:26,718 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 20:38:26,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:38:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 20:38:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 20:38:26,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:38:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-03 20:38:26,723 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-09-03 20:38:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:26,723 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-03 20:38:26,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:38:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-03 20:38:26,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:38:26,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:26,724 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:26,724 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:26,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash -833710564, now seen corresponding path program 5 times [2019-09-03 20:38:26,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:26,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:26,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:26,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:26,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:38:26,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:26,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:26,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:26,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:26,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:26,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 20:38:26,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:38:26,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:38:26,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:38:26,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:26,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:38:26,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 20:38:26,973 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 20:38:27,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:27,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2019-09-03 20:38:27,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:27,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:38:27,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:38:27,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:38:27,063 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 12 states. [2019-09-03 20:38:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:31,540 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-09-03 20:38:31,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:38:31,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-03 20:38:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:31,542 INFO L225 Difference]: With dead ends: 36 [2019-09-03 20:38:31,542 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 20:38:31,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:38:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 20:38:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-09-03 20:38:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:38:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-03 20:38:31,546 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2019-09-03 20:38:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:31,546 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-03 20:38:31,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:38:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-03 20:38:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:38:31,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:31,548 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:31,548 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:31,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:31,548 INFO L82 PathProgramCache]: Analyzing trace with hash -644516716, now seen corresponding path program 6 times [2019-09-03 20:38:31,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:31,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:31,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:31,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:31,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:38:31,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:31,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:31,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:31,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:31,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:31,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:31,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:38:31,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:38:31,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:38:31,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:31,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:38:31,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:38:31,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:38:32,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:32,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2019-09-03 20:38:32,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:32,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:38:32,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:38:32,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:38:32,074 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 11 states. [2019-09-03 20:38:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:32,221 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-09-03 20:38:32,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:38:32,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-09-03 20:38:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:32,226 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:38:32,226 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:38:32,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:38:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:38:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 20:38:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:38:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-09-03 20:38:32,231 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2019-09-03 20:38:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:32,231 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-09-03 20:38:32,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:38:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-09-03 20:38:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:38:32,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:32,232 INFO L399 BasicCegarLoop]: trace histogram [11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:32,233 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:32,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:32,233 INFO L82 PathProgramCache]: Analyzing trace with hash -30848559, now seen corresponding path program 7 times [2019-09-03 20:38:32,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:32,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:32,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:32,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:32,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:38:32,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:32,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:32,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:32,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:32,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:32,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 20:38:32,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:32,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:38:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:32,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:38:32,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:38:32,459 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:38:33,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:33,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 22 [2019-09-03 20:38:33,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:33,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:38:33,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:38:33,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:38:33,148 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 12 states. [2019-09-03 20:38:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:33,349 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-03 20:38:33,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:38:33,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-09-03 20:38:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:33,350 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:38:33,351 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:38:33,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:38:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:38:33,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 20:38:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:38:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-09-03 20:38:33,354 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2019-09-03 20:38:33,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:33,355 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-09-03 20:38:33,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:38:33,355 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-09-03 20:38:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:38:33,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:33,356 INFO L399 BasicCegarLoop]: trace histogram [12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:33,356 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:33,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:33,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1293730766, now seen corresponding path program 8 times [2019-09-03 20:38:33,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:33,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:33,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:33,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:33,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:38:33,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:33,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:33,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:33,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:33,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:33,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 20:38:33,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:38:33,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:38:33,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:38:33,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:33,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:38:33,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-03 20:38:33,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-03 20:38:33,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:33,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 20 [2019-09-03 20:38:33,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:33,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:38:33,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:38:33,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:38:33,771 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 16 states. [2019-09-03 20:38:34,797 WARN L188 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 20:38:37,051 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-03 20:38:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:39,454 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-09-03 20:38:39,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:38:39,454 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-03 20:38:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:39,456 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:38:39,456 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:38:39,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:38:39,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:38:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-09-03 20:38:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:38:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 20:38:39,461 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 34 [2019-09-03 20:38:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:39,461 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 20:38:39,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:38:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 20:38:39,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:38:39,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:39,463 INFO L399 BasicCegarLoop]: trace histogram [14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:39,463 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:39,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:39,464 INFO L82 PathProgramCache]: Analyzing trace with hash 284766406, now seen corresponding path program 9 times [2019-09-03 20:38:39,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:39,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:39,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:39,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:39,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:38:39,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:39,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:39,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:39,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:39,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:39,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:39,728 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:38:39,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:38:39,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:38:39,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:39,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:38:39,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:38:39,797 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:38:40,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:40,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 26 [2019-09-03 20:38:40,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:40,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:38:40,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:38:40,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:38:40,385 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 14 states. [2019-09-03 20:38:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:40,649 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-03 20:38:40,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:38:40,650 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-09-03 20:38:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:40,651 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:38:40,651 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 20:38:40,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:38:40,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 20:38:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 20:38:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:38:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-03 20:38:40,656 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 38 [2019-09-03 20:38:40,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:40,656 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-03 20:38:40,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:38:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-03 20:38:40,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:38:40,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:40,658 INFO L399 BasicCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:40,658 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:40,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:40,658 INFO L82 PathProgramCache]: Analyzing trace with hash 926316803, now seen corresponding path program 10 times [2019-09-03 20:38:40,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:40,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:40,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:40,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:40,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:38:40,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:40,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:40,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:40,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:40,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:40,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:40,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:40,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:38:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:40,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:38:40,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:38:40,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:38:41,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:41,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 28 [2019-09-03 20:38:41,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:41,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:38:41,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:38:41,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:38:41,873 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 15 states. [2019-09-03 20:38:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:42,193 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-03 20:38:42,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:38:42,195 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-09-03 20:38:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:42,196 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:38:42,196 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:38:42,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:38:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:38:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 20:38:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:38:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-03 20:38:42,201 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 40 [2019-09-03 20:38:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:42,202 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-03 20:38:42,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:38:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-03 20:38:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:38:42,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:42,203 INFO L399 BasicCegarLoop]: trace histogram [16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:42,203 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:42,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1019042304, now seen corresponding path program 11 times [2019-09-03 20:38:42,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:42,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:42,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:42,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:38:42,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:42,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:42,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:42,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:38:42,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:42,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:42,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:38:42,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:38:42,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 20:38:43,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:43,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:38:43,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 16 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-03 20:38:43,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 16 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-03 20:38:43,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:43,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 25 [2019-09-03 20:38:43,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:43,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:38:43,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:38:43,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:38:43,274 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 20 states. [2019-09-03 20:39:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:04,344 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-09-03 20:39:04,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:39:04,345 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-03 20:39:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:04,345 INFO L225 Difference]: With dead ends: 50 [2019-09-03 20:39:04,346 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 20:39:04,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=261, Invalid=606, Unknown=3, NotChecked=0, Total=870 [2019-09-03 20:39:04,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 20:39:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-03 20:39:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:39:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-03 20:39:04,350 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2019-09-03 20:39:04,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:04,351 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-03 20:39:04,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:39:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-03 20:39:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:39:04,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:04,352 INFO L399 BasicCegarLoop]: trace histogram [18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:04,352 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:04,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:04,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1622573432, now seen corresponding path program 12 times [2019-09-03 20:39:04,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:04,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:04,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:04,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:39:04,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:04,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:04,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:04,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:04,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:04,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 20:39:04,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:39:04,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:39:04,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:39:04,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:04,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:39:04,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:39:04,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:39:05,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:05,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 32 [2019-09-03 20:39:05,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:05,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:39:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:39:05,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:39:05,965 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 17 states. [2019-09-03 20:39:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:06,435 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-09-03 20:39:06,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:39:06,436 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-09-03 20:39:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:06,436 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:39:06,437 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 20:39:06,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:39:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 20:39:06,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-03 20:39:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 20:39:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-03 20:39:06,441 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 46 [2019-09-03 20:39:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:06,441 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-03 20:39:06,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:39:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-03 20:39:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:39:06,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:06,442 INFO L399 BasicCegarLoop]: trace histogram [19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:06,443 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:06,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:06,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1921368907, now seen corresponding path program 13 times [2019-09-03 20:39:06,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:06,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:06,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:06,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:06,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:39:06,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:06,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:06,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:06,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:06,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:06,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 20:39:06,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:06,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:39:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:06,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:39:06,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:39:06,838 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:39:08,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:08,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-03 20:39:08,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:08,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:39:08,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:39:08,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:39:08,366 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 18 states. [2019-09-03 20:39:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:08,772 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-09-03 20:39:08,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:39:08,773 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-09-03 20:39:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:08,774 INFO L225 Difference]: With dead ends: 51 [2019-09-03 20:39:08,774 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 20:39:08,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:39:08,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 20:39:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-03 20:39:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 20:39:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-03 20:39:08,780 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 48 [2019-09-03 20:39:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:08,781 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-03 20:39:08,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:39:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-03 20:39:08,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 20:39:08,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:08,782 INFO L399 BasicCegarLoop]: trace histogram [20, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:08,782 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:08,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1740890958, now seen corresponding path program 14 times [2019-09-03 20:39:08,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:08,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:08,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:08,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:08,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:39:09,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:09,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:09,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:09,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:09,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:09,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 20:39:09,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:39:09,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:39:57,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:39:57,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:57,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:39:57,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 22 refuted. 3 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:40:04,342 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 24 refuted. 1 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:40:07,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:07,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 9] total 31 [2019-09-03 20:40:07,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:07,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:40:07,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:40:07,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=661, Unknown=4, NotChecked=0, Total=930 [2019-09-03 20:40:07,400 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 24 states. [2019-09-03 20:40:25,383 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 20:40:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:30,863 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-09-03 20:40:30,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:40:30,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-03 20:40:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:30,864 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:40:30,864 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:40:30,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=359, Invalid=969, Unknown=4, NotChecked=0, Total=1332 [2019-09-03 20:40:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:40:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-09-03 20:40:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:40:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-09-03 20:40:30,869 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 50 [2019-09-03 20:40:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:30,870 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-09-03 20:40:30,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:40:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-09-03 20:40:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 20:40:30,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:30,871 INFO L399 BasicCegarLoop]: trace histogram [22, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:30,871 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:30,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash -741259606, now seen corresponding path program 15 times [2019-09-03 20:40:30,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:30,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:30,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:40:30,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:30,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:40:31,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:31,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:31,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:31,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:31,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:31,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 20:40:31,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:40:31,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:40:31,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:40:31,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:40:31,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:40:31,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:40:31,352 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 270 refuted. 2 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:40:36,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:36,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 38 [2019-09-03 20:40:36,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:36,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:40:36,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:40:36,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=990, Unknown=1, NotChecked=0, Total=1406 [2019-09-03 20:40:36,301 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 20 states. [2019-09-03 20:40:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:36,884 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-09-03 20:40:36,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:40:36,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-09-03 20:40:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:36,887 INFO L225 Difference]: With dead ends: 57 [2019-09-03 20:40:36,887 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 20:40:36,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=415, Invalid=990, Unknown=1, NotChecked=0, Total=1406 [2019-09-03 20:40:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 20:40:36,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-03 20:40:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 20:40:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-09-03 20:40:36,895 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 54 [2019-09-03 20:40:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:36,898 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-09-03 20:40:36,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:40:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-09-03 20:40:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:40:36,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:36,900 INFO L399 BasicCegarLoop]: trace histogram [23, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:36,900 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash -554142489, now seen corresponding path program 16 times [2019-09-03 20:40:36,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:36,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:36,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:40:36,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:36,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:40:37,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:37,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:37,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:37,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:37,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:37,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:40:37,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:40:37,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:40:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:37,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:40:37,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:40:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:40:37,437 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:40:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:40:39,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:40:39,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 40 [2019-09-03 20:40:39,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:40:39,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:40:39,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:40:39,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:40:39,191 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 21 states. [2019-09-03 20:40:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:40:39,740 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-09-03 20:40:39,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:40:39,740 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2019-09-03 20:40:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:40:39,741 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:40:39,741 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:40:39,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:40:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:40:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-03 20:40:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:40:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-09-03 20:40:39,745 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 56 [2019-09-03 20:40:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:40:39,746 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-09-03 20:40:39,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:40:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-09-03 20:40:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 20:40:39,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:40:39,747 INFO L399 BasicCegarLoop]: trace histogram [24, 18, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:40:39,747 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:40:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:40:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1123219484, now seen corresponding path program 17 times [2019-09-03 20:40:39,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:40:39,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:39,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:40:39,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:40:39,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:40:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:40:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 209 proven. 342 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:40:40,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:40,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:40:40,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:40:40,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:40:40,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:40:40,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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) [2019-09-03 20:40:40,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:40:40,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:31,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:41:31,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:31,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:41:31,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-03 20:41:31,758 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-03 20:41:32,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:32,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9, 9] total 35 [2019-09-03 20:41:32,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:32,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:41:32,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:41:32,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=846, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:41:32,044 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 28 states. [2019-09-03 20:41:35,056 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967283) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-03 20:41:42,890 WARN L188 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 20:41:46,391 WARN L188 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 20:42:01,862 WARN L188 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 20:42:16,037 WARN L188 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 20:42:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:29,371 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2019-09-03 20:42:29,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:42:29,372 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-03 20:42:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:29,372 INFO L225 Difference]: With dead ends: 70 [2019-09-03 20:42:29,372 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 20:42:29,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=550, Invalid=1340, Unknown=6, NotChecked=84, Total=1980 [2019-09-03 20:42:29,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 20:42:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2019-09-03 20:42:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 20:42:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-03 20:42:29,377 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 58 [2019-09-03 20:42:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:29,377 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-03 20:42:29,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:42:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-03 20:42:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 20:42:29,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:29,378 INFO L399 BasicCegarLoop]: trace histogram [26, 19, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:29,379 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:29,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:29,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1126866852, now seen corresponding path program 18 times [2019-09-03 20:42:29,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:29,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:29,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:29,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:29,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:42:29,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:29,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:29,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:29,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:29,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:29,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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) [2019-09-03 20:42:29,863 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:42:29,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:42:29,889 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:42:29,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:29,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:42:29,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:42:29,970 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:42:31,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:31,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 44 [2019-09-03 20:42:31,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:31,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:42:31,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:42:31,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=1345, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:42:31,921 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 23 states. [2019-09-03 20:42:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:32,695 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-09-03 20:42:32,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:42:32,698 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2019-09-03 20:42:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:32,699 INFO L225 Difference]: With dead ends: 65 [2019-09-03 20:42:32,699 INFO L226 Difference]: Without dead ends: 65 [2019-09-03 20:42:32,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=547, Invalid=1345, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:42:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-03 20:42:32,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-03 20:42:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 20:42:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-03 20:42:32,705 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 62 [2019-09-03 20:42:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:32,705 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-03 20:42:32,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:42:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-03 20:42:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:42:32,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:32,706 INFO L399 BasicCegarLoop]: trace histogram [27, 20, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:32,707 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:32,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:32,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1362952601, now seen corresponding path program 19 times [2019-09-03 20:42:32,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:32,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:32,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:32,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:32,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:42:33,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:33,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:33,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:33,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:33,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:33,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 20:42:33,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:33,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:42:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:33,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:42:33,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:42:33,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:42:35,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:35,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 46 [2019-09-03 20:42:35,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:35,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:42:35,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:42:35,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:42:35,722 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 24 states. [2019-09-03 20:42:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:36,546 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-09-03 20:42:36,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:42:36,547 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-09-03 20:42:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:36,548 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:42:36,548 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:42:36,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:42:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:42:36,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-03 20:42:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 20:42:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-03 20:42:36,552 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 64 [2019-09-03 20:42:36,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:36,552 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-03 20:42:36,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:42:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-03 20:42:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 20:42:36,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:36,554 INFO L399 BasicCegarLoop]: trace histogram [28, 21, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:36,554 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:36,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:36,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1782663062, now seen corresponding path program 20 times [2019-09-03 20:42:36,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:36,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:36,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:36,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:36,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 286 proven. 462 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:42:37,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:37,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:37,002 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:37,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:37,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:37,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 20:42:37,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:42:37,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:42:48,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:42:48,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:48,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:42:48,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 49 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:42:48,876 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 49 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:42:49,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:49,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 10] total 40 [2019-09-03 20:42:49,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:49,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:42:49,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:42:49,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1118, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:42:49,308 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 32 states. [2019-09-03 20:43:01,285 WARN L188 SmtUtils]: Spent 5.13 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-03 20:43:16,619 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-03 20:43:29,287 WARN L188 SmtUtils]: Spent 7.76 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 20:43:37,361 WARN L188 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 20:43:42,696 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 20:44:05,115 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-03 20:44:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:44:33,279 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-09-03 20:44:33,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:44:33,279 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-03 20:44:33,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:44:33,280 INFO L225 Difference]: With dead ends: 75 [2019-09-03 20:44:33,280 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:44:33,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 82.5s TimeCoverageRelationStatistics Valid=670, Invalid=1675, Unknown=7, NotChecked=0, Total=2352 [2019-09-03 20:44:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:44:33,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-09-03 20:44:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 20:44:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-09-03 20:44:33,283 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 66 [2019-09-03 20:44:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:44:33,284 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-09-03 20:44:33,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:44:33,284 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-09-03 20:44:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 20:44:33,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:44:33,285 INFO L399 BasicCegarLoop]: trace histogram [30, 22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:44:33,285 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:44:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:44:33,285 INFO L82 PathProgramCache]: Analyzing trace with hash -204034418, now seen corresponding path program 21 times [2019-09-03 20:44:33,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:44:33,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:33,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:44:33,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:33,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:44:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 506 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:44:33,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:33,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:44:33,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:44:33,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:44:33,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:33,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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) [2019-09-03 20:44:33,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:44:33,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:44:34,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:44:34,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:44:34,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:44:34,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:44:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 506 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:44:34,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:44:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 504 refuted. 2 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:44:40,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:44:40,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 26] total 50 [2019-09-03 20:44:40,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:44:40,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:44:40,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:44:40,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=1752, Unknown=1, NotChecked=0, Total=2450 [2019-09-03 20:44:40,053 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 26 states. [2019-09-03 20:44:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:44:40,968 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-09-03 20:44:40,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:44:40,968 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2019-09-03 20:44:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:44:40,970 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:44:40,970 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 20:44:40,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=697, Invalid=1752, Unknown=1, NotChecked=0, Total=2450 [2019-09-03 20:44:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 20:44:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-09-03 20:44:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 20:44:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-09-03 20:44:40,974 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 70 [2019-09-03 20:44:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:44:40,974 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-09-03 20:44:40,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:44:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-09-03 20:44:40,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:44:40,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:44:40,975 INFO L399 BasicCegarLoop]: trace histogram [31, 23, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:44:40,975 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:44:40,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:44:40,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1889811765, now seen corresponding path program 22 times [2019-09-03 20:44:40,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:44:40,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:40,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:44:40,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:40,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:44:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:44:41,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:41,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:44:41,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:44:41,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:44:41,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:41,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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) [2019-09-03 20:44:41,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:44:41,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:44:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:41,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 20:44:41,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:44:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:44:41,695 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:44:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:44:43,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:44:43,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 27] total 52 [2019-09-03 20:44:43,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:44:43,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:44:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:44:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1901, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:44:43,838 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 27 states. [2019-09-03 20:44:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:44:44,852 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-09-03 20:44:44,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:44:44,853 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-09-03 20:44:44,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:44:44,854 INFO L225 Difference]: With dead ends: 75 [2019-09-03 20:44:44,854 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:44:44,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=751, Invalid=1901, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:44:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:44:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-03 20:44:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 20:44:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-09-03 20:44:44,859 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 72 [2019-09-03 20:44:44,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:44:44,859 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-09-03 20:44:44,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:44:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-09-03 20:44:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 20:44:44,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:44:44,860 INFO L399 BasicCegarLoop]: trace histogram [32, 24, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:44:44,860 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:44:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:44:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1575795656, now seen corresponding path program 23 times [2019-09-03 20:44:44,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:44:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:44,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:44:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:44,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:44:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 375 proven. 600 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:44:45,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:45,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:44:45,388 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:44:45,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:44:45,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:45,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:44:45,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:44:45,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:47:07,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:47:07,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:47:08,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:47:08,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:47:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 64 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-03 20:47:08,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:47:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 64 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-03 20:47:09,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:47:09,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11, 11] total 45 [2019-09-03 20:47:09,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:47:09,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:47:09,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:47:09,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1428, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:47:09,038 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 36 states. [2019-09-03 20:47:22,325 WARN L188 SmtUtils]: Spent 9.46 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-03 20:47:31,570 WARN L188 SmtUtils]: Spent 6.48 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-03 20:47:52,722 WARN L188 SmtUtils]: Spent 7.08 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-03 20:48:02,362 WARN L188 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 20:48:05,667 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 20:48:15,667 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-03 20:48:20,636 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967283) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967279) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 65520)) is different from false [2019-09-03 20:48:25,570 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-03 20:48:38,445 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 20:48:50,409 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 20:48:55,013 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967283) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-03 20:49:17,940 WARN L188 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-03 20:49:22,331 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967283) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967279) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-03 20:49:47,124 WARN L188 SmtUtils]: Spent 4.44 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-03 20:50:09,169 WARN L188 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-03 20:50:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:09,369 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2019-09-03 20:50:09,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 20:50:09,370 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-03 20:50:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:09,371 INFO L225 Difference]: With dead ends: 93 [2019-09-03 20:50:09,371 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 20:50:09,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 146.6s TimeCoverageRelationStatistics Valid=975, Invalid=2442, Unknown=21, NotChecked=468, Total=3906 [2019-09-03 20:50:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 20:50:09,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-09-03 20:50:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 20:50:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2019-09-03 20:50:09,376 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 74 [2019-09-03 20:50:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:09,376 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2019-09-03 20:50:09,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:50:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2019-09-03 20:50:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:50:09,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:09,377 INFO L399 BasicCegarLoop]: trace histogram [34, 25, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:09,377 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1804529344, now seen corresponding path program 24 times [2019-09-03 20:50:09,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:09,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:09,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:50:09,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:09,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 650 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:50:09,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:09,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:09,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:09,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:09,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:09,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:10,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:50:10,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:50:10,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:50:10,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:50:10,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 20:50:10,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 650 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:50:10,142 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 648 refuted. 2 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:50:15,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:15,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 29] total 56 [2019-09-03 20:50:15,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:15,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:50:15,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:50:15,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=2214, Unknown=1, NotChecked=0, Total=3080 [2019-09-03 20:50:15,548 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 29 states. [2019-09-03 20:50:16,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:16,708 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-09-03 20:50:16,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:50:16,709 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2019-09-03 20:50:16,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:16,710 INFO L225 Difference]: With dead ends: 81 [2019-09-03 20:50:16,710 INFO L226 Difference]: Without dead ends: 81 [2019-09-03 20:50:16,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=865, Invalid=2214, Unknown=1, NotChecked=0, Total=3080 [2019-09-03 20:50:16,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-03 20:50:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-03 20:50:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-03 20:50:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2019-09-03 20:50:16,714 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 78 [2019-09-03 20:50:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:16,715 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2019-09-03 20:50:16,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:50:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2019-09-03 20:50:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:50:16,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:16,716 INFO L399 BasicCegarLoop]: trace histogram [35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:16,716 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:16,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2014275459, now seen corresponding path program 25 times [2019-09-03 20:50:16,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:16,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:50:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:16,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:50:17,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:17,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:17,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:17,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:17,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:17,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:17,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:17,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:50:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:17,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 20:50:17,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:50:17,512 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:50:22,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:22,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 30] total 58 [2019-09-03 20:50:22,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:22,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:50:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:50:22,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=925, Invalid=2381, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:50:22,017 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 30 states. [2019-09-03 20:50:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:23,336 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2019-09-03 20:50:23,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:50:23,336 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2019-09-03 20:50:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:23,338 INFO L225 Difference]: With dead ends: 83 [2019-09-03 20:50:23,338 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 20:50:23,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=925, Invalid=2381, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:50:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 20:50:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-03 20:50:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 20:50:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-09-03 20:50:23,342 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 80 [2019-09-03 20:50:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:23,342 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-09-03 20:50:23,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:50:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-09-03 20:50:23,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 20:50:23,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:23,343 INFO L399 BasicCegarLoop]: trace histogram [36, 27, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:23,343 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:23,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1716829062, now seen corresponding path program 26 times [2019-09-03 20:50:23,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:23,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:23,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:23,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:23,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 476 proven. 756 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:50:23,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:23,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:23,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:23,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:23,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:23,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:50:23,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:50:23,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:58,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-03 20:52:58,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:58,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:52:58,261 INFO L279 TraceCheckSpWp]: Computing forward predicates...