java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/phases_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:37:04,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:37:04,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:37:04,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:37:04,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:37:04,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:37:04,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:37:04,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:37:04,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:37:04,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:37:04,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:37:04,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:37:04,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:37:04,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:37:04,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:37:04,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:37:04,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:37:04,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:37:04,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:37:04,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:37:04,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:37:04,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:37:04,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:37:04,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:37:04,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:37:04,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:37:04,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:37:04,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:37:04,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:37:04,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:37:04,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:37:04,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:37:04,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:37:04,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:37:04,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:37:04,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:37:04,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:37:04,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:37:04,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:37:04,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:37:04,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:37:04,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:37:04,290 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:37:04,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:37:04,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:37:04,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:37:04,293 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:37:04,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:37:04,294 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:37:04,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:37:04,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:37:04,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:37:04,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:37:04,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:37:04,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:37:04,296 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:37:04,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:37:04,297 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:37:04,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:37:04,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:37:04,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:37:04,298 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:37:04,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:37:04,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:37:04,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:37:04,299 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:37:04,299 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:37:04,299 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:37:04,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:37:04,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:37:04,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:37:04,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:37:04,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:37:04,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:37:04,371 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:37:04,371 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:37:04,372 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 19:37:04,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa3b405c/236dc83b0da94ceca3d84741460071d1/FLAG5e5965f73 [2019-09-03 19:37:04,855 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:37:04,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2019-09-03 19:37:04,863 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa3b405c/236dc83b0da94ceca3d84741460071d1/FLAG5e5965f73 [2019-09-03 19:37:05,280 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa3b405c/236dc83b0da94ceca3d84741460071d1 [2019-09-03 19:37:05,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:37:05,291 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:37:05,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:37:05,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:37:05,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:37:05,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:37:05" (1/1) ... [2019-09-03 19:37:05,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6595b9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:37:05, skipping insertion in model container [2019-09-03 19:37:05,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:37:05" (1/1) ... [2019-09-03 19:37:05,307 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:37:05,327 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:37:05,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:37:05,560 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:37:05,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:37:05,597 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:37:05,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:37:05 WrapperNode [2019-09-03 19:37:05,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:37:05,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:37:05,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:37:05,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:37:05,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:37:05" (1/1) ... [2019-09-03 19:37:05,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:37:05" (1/1) ... [2019-09-03 19:37:05,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:37:05" (1/1) ... [2019-09-03 19:37:05,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:37:05" (1/1) ... [2019-09-03 19:37:05,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:37:05" (1/1) ... [2019-09-03 19:37:05,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:37:05" (1/1) ... [2019-09-03 19:37:05,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:37:05" (1/1) ... [2019-09-03 19:37:05,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:37:05,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:37:05,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:37:05,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:37:05,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:37:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:37:05,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:37:05,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:37:05,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:37:05,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:37:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:37:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:37:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:37:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:37:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:37:05,913 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:37:05,914 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:37:05,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:37:05 BoogieIcfgContainer [2019-09-03 19:37:05,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:37:05,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:37:05,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:37:05,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:37:05,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:37:05" (1/3) ... [2019-09-03 19:37:05,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ac54e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:37:05, skipping insertion in model container [2019-09-03 19:37:05,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:37:05" (2/3) ... [2019-09-03 19:37:05,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ac54e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:37:05, skipping insertion in model container [2019-09-03 19:37:05,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:37:05" (3/3) ... [2019-09-03 19:37:05,922 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2019-09-03 19:37:05,932 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:37:05,941 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:37:05,956 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:37:05,983 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:37:05,984 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:37:05,984 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:37:05,984 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:37:05,984 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:37:05,984 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:37:05,984 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:37:05,985 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:37:05,985 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:37:06,001 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-03 19:37:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:37:06,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:06,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:06,009 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-03 19:37:06,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:06,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:06,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:06,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:37:06,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:06,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:37:06,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:37:06,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:37:06,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:37:06,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:37:06,137 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-03 19:37:06,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:06,157 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-03 19:37:06,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:37:06,158 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 19:37:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:06,166 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:37:06,166 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 19:37:06,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:37:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 19:37:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 19:37:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 19:37:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-03 19:37:06,203 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-03 19:37:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:06,204 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-03 19:37:06,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:37:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-03 19:37:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:37:06,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:06,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:06,205 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-03 19:37:06,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:06,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:06,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:06,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:37:06,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:06,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:37:06,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:37:06,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:37:06,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:37:06,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:37:06,349 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-03 19:37:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:06,375 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-09-03 19:37:06,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:37:06,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 19:37:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:06,377 INFO L225 Difference]: With dead ends: 21 [2019-09-03 19:37:06,377 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 19:37:06,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:37:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 19:37:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 19:37:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 19:37:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-03 19:37:06,391 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-03 19:37:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:06,391 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-03 19:37:06,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:37:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-03 19:37:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:37:06,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:06,397 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:06,398 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:06,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:06,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-03 19:37:06,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:06,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:06,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:06,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:37:06,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:06,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:06,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:06,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:37:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:06,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:37:06,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:06,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:06,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 19:37:06,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:37:06,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:37:06,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:37:06,620 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-03 19:37:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:06,659 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-03 19:37:06,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:37:06,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 19:37:06,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:06,660 INFO L225 Difference]: With dead ends: 23 [2019-09-03 19:37:06,661 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 19:37:06,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:37:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 19:37:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 19:37:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 19:37:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-09-03 19:37:06,666 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-09-03 19:37:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:06,666 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-09-03 19:37:06,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:37:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-09-03 19:37:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:37:06,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:06,668 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:06,668 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:06,669 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-03 19:37:06,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:06,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:06,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:06,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:37:06,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:06,805 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 19:37:06,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:06,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:37:06,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:06,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:37:06,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:06,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:37:06,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:06,870 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 19:37:06,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:06,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:37:06,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:37:06,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:37:06,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:37:06,875 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2019-09-03 19:37:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:06,934 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-09-03 19:37:06,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:37:06,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-03 19:37:06,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:06,937 INFO L225 Difference]: With dead ends: 25 [2019-09-03 19:37:06,937 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:37:06,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:37:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:37:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 19:37:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 19:37:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-03 19:37:06,948 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2019-09-03 19:37:06,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:06,948 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-03 19:37:06,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:37:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-03 19:37:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:37:06,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:06,950 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:06,950 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:06,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:06,951 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2019-09-03 19:37:06,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:06,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:06,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:06,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:06,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:07,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:07,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:07,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:07,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:37:07,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 19:37:07,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:07,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:37:07,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 19:37:07,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:37:07,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-03 19:37:07,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:37:07,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:37:07,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:37:07,144 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-09-03 19:37:07,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:07,230 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-09-03 19:37:07,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:37:07,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-03 19:37:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:07,233 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:37:07,233 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:37:07,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:37:07,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:37:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-03 19:37:07,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 19:37:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-03 19:37:07,243 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2019-09-03 19:37:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:07,244 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-03 19:37:07,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:37:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-03 19:37:07,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:37:07,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:07,246 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:07,246 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:07,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:07,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1988642215, now seen corresponding path program 1 times [2019-09-03 19:37:07,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:07,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:07,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:07,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:07,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:07,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:07,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:07,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:37:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:07,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:37:07,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:37:07,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:07,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:37:07,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:37:07,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:37:07,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:37:07,490 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2019-09-03 19:37:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:07,561 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-03 19:37:07,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:37:07,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-03 19:37:07,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:07,562 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:37:07,563 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 19:37:07,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:37:07,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 19:37:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 19:37:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:37:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-03 19:37:07,568 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-09-03 19:37:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:07,568 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-03 19:37:07,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:37:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-03 19:37:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:37:07,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:07,569 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:07,570 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:07,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:07,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1766658852, now seen corresponding path program 2 times [2019-09-03 19:37:07,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:07,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:07,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:07,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:37:07,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:07,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:07,708 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:37:07,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:07,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:37:07,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:07,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:37:07,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:07,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:07,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2019-09-03 19:37:07,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:37:07,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:37:07,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:37:07,796 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 10 states. [2019-09-03 19:37:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:07,923 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-09-03 19:37:07,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:37:07,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-03 19:37:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:07,924 INFO L225 Difference]: With dead ends: 33 [2019-09-03 19:37:07,925 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 19:37:07,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:37:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 19:37:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 19:37:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:37:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-03 19:37:07,939 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-09-03 19:37:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:07,939 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-03 19:37:07,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:37:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-03 19:37:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:37:07,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:07,940 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:07,941 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:07,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:07,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1105955487, now seen corresponding path program 3 times [2019-09-03 19:37:07,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:07,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:07,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:07,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:07,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:08,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:08,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:08,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:37:08,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:37:08,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:08,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:37:08,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 19:37:08,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:08,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-09-03 19:37:08,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:37:08,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:37:08,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:37:08,201 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2019-09-03 19:37:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:08,768 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-09-03 19:37:08,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:37:08,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-03 19:37:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:08,771 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:37:08,771 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:37:08,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:37:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:37:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-09-03 19:37:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:37:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-09-03 19:37:08,777 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2019-09-03 19:37:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:08,778 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-09-03 19:37:08,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:37:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-09-03 19:37:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:37:08,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:08,779 INFO L399 BasicCegarLoop]: trace histogram [9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:08,779 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:08,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:08,779 INFO L82 PathProgramCache]: Analyzing trace with hash -806317607, now seen corresponding path program 4 times [2019-09-03 19:37:08,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:08,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:08,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:08,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:08,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:37:08,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:08,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:37:08,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:08,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:37:08,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:08,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:37:08,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:37:09,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:09,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-03 19:37:09,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:37:09,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:37:09,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:37:09,032 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 11 states. [2019-09-03 19:37:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:09,170 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-09-03 19:37:09,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:37:09,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-03 19:37:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:09,173 INFO L225 Difference]: With dead ends: 41 [2019-09-03 19:37:09,173 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 19:37:09,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:37:09,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 19:37:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 19:37:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:37:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-03 19:37:09,183 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2019-09-03 19:37:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:09,183 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-03 19:37:09,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:37:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-03 19:37:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:37:09,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:09,187 INFO L399 BasicCegarLoop]: trace histogram [10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:09,187 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:09,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:09,188 INFO L82 PathProgramCache]: Analyzing trace with hash -251489706, now seen corresponding path program 5 times [2019-09-03 19:37:09,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:09,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:09,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:37:09,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:09,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:09,396 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:37:41,562 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-03 19:37:41,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:41,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:37:41,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:41,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:41,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 14 [2019-09-03 19:37:41,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:37:41,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:37:41,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:37:41,774 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 14 states. [2019-09-03 19:37:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:41,963 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-09-03 19:37:41,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:37:41,963 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-03 19:37:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:41,964 INFO L225 Difference]: With dead ends: 43 [2019-09-03 19:37:41,964 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:37:41,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:37:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:37:41,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 19:37:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:37:41,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-09-03 19:37:41,974 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2019-09-03 19:37:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:41,978 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-09-03 19:37:41,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:37:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-09-03 19:37:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:37:41,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:41,979 INFO L399 BasicCegarLoop]: trace histogram [11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:41,979 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:41,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:41,980 INFO L82 PathProgramCache]: Analyzing trace with hash 362178451, now seen corresponding path program 6 times [2019-09-03 19:37:41,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:41,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:41,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:41,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:41,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:37:42,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:42,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:37:42,189 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:42,850 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-03 19:37:42,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:42,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:37:42,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 19:37:42,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:42,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-09-03 19:37:42,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:37:42,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:37:42,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:37:42,993 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 18 states. [2019-09-03 19:37:45,978 WARN L188 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 19:37:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:57,525 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2019-09-03 19:37:57,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:37:57,526 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-09-03 19:37:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:57,529 INFO L225 Difference]: With dead ends: 63 [2019-09-03 19:37:57,529 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 19:37:57,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=196, Invalid=559, Unknown=1, NotChecked=0, Total=756 [2019-09-03 19:37:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 19:37:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-09-03 19:37:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:37:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 19:37:57,537 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 32 [2019-09-03 19:37:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:57,537 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 19:37:57,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:37:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 19:37:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:37:57,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:57,539 INFO L399 BasicCegarLoop]: trace histogram [14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:57,539 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:57,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash 284766406, now seen corresponding path program 7 times [2019-09-03 19:37:57,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:57,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:57,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:57,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:57,740 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 19:37:57,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:57,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:57,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:37:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:57,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:37:57,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:57,836 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 19:37:57,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:57,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-03 19:37:57,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:37:57,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:37:57,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:37:57,845 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 14 states. [2019-09-03 19:37:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:58,017 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-09-03 19:37:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:37:58,018 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-09-03 19:37:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:58,019 INFO L225 Difference]: With dead ends: 55 [2019-09-03 19:37:58,019 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 19:37:58,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:37:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 19:37:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 19:37:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:37:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-03 19:37:58,026 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 38 [2019-09-03 19:37:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:58,026 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-03 19:37:58,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:37:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-03 19:37:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:37:58,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:58,027 INFO L399 BasicCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:58,028 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:58,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash 926316803, now seen corresponding path program 8 times [2019-09-03 19:37:58,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:58,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:58,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:58,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:37:58,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:58,245 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 19:37:58,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:58,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:58,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:37:58,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:37:58,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:58,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:37:58,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:37:58,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:58,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 19 [2019-09-03 19:37:58,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:37:58,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:37:58,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:37:58,429 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 19 states. [2019-09-03 19:37:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:37:58,777 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-09-03 19:37:58,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:37:58,777 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-03 19:37:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:37:58,778 INFO L225 Difference]: With dead ends: 57 [2019-09-03 19:37:58,778 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:37:58,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:37:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:37:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 19:37:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:37:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-03 19:37:58,784 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 40 [2019-09-03 19:37:58,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:37:58,784 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-03 19:37:58,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:37:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-03 19:37:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:37:58,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:37:58,786 INFO L399 BasicCegarLoop]: trace histogram [16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:37:58,786 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:37:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:37:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1019042304, now seen corresponding path program 9 times [2019-09-03 19:37:58,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:37:58,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:37:58,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:58,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:37:58,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:37:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:37:59,025 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 19:37:59,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:37:59,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:37:59,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:37:59,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 19:37:59,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:37:59,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:37:59,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:37:59,832 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 19:37:59,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:37:59,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 20 [2019-09-03 19:37:59,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:37:59,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:37:59,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:37:59,844 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 20 states. [2019-09-03 19:38:07,015 WARN L188 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-09-03 19:38:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:10,978 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2019-09-03 19:38:10,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:38:10,979 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-03 19:38:10,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:10,980 INFO L225 Difference]: With dead ends: 64 [2019-09-03 19:38:10,980 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:38:10,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:38:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:38:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-03 19:38:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:38:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-03 19:38:10,992 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2019-09-03 19:38:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:10,992 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-03 19:38:10,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:38:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-03 19:38:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:38:10,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:10,993 INFO L399 BasicCegarLoop]: trace histogram [18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:10,994 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:10,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:10,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1622573432, now seen corresponding path program 10 times [2019-09-03 19:38:10,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:10,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:10,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:10,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:10,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:11,258 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 19:38:11,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:11,258 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:38:11,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:38:11,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:38:11,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:11,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:38:11,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:11,381 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 19:38:11,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:11,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-03 19:38:11,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:38:11,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:38:11,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:38:11,385 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 17 states. [2019-09-03 19:38:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:11,699 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-09-03 19:38:11,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:38:11,701 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-09-03 19:38:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:11,702 INFO L225 Difference]: With dead ends: 65 [2019-09-03 19:38:11,702 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 19:38:11,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:38:11,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 19:38:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-03 19:38:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:38:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-03 19:38:11,709 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 46 [2019-09-03 19:38:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:11,709 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-03 19:38:11,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:38:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-03 19:38:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:38:11,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:11,710 INFO L399 BasicCegarLoop]: trace histogram [19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:11,711 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:11,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1921368907, now seen corresponding path program 11 times [2019-09-03 19:38:11,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:11,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:11,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:11,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:11,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:11,974 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 19:38:11,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:11,975 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:11,994 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:41:22,833 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-09-03 19:41:22,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:41:22,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:41:22,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:41:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 85 proven. 272 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:41:22,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:41:22,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 20 [2019-09-03 19:41:22,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:41:22,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:41:22,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:41:22,968 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 20 states. [2019-09-03 19:41:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:41:23,323 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2019-09-03 19:41:23,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:41:23,323 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2019-09-03 19:41:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:41:23,324 INFO L225 Difference]: With dead ends: 67 [2019-09-03 19:41:23,325 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 19:41:23,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:41:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 19:41:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-03 19:41:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 19:41:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-03 19:41:23,332 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 48 [2019-09-03 19:41:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:41:23,333 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-03 19:41:23,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:41:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-03 19:41:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:41:23,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:41:23,334 INFO L399 BasicCegarLoop]: trace histogram [20, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:41:23,334 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:41:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:41:23,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1740890958, now seen corresponding path program 12 times [2019-09-03 19:41:23,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:41:23,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:41:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:23,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:41:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:23,609 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 19:41:23,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:41:23,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:41:23,661 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:41:23,909 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-09-03 19:41:23,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:41:23,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:41:23,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:41:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 174 proven. 196 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 19:41:24,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:41:24,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-09-03 19:41:24,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:41:24,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:41:24,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:41:24,340 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 33 states. [2019-09-03 19:41:46,360 WARN L188 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 52 DAG size of output: 12 [2019-09-03 19:41:49,433 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967290) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967282) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967278) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967276) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-03 19:42:07,444 WARN L188 SmtUtils]: Spent 13.03 s on a formula simplification. DAG size of input: 52 DAG size of output: 16 [2019-09-03 19:42:27,146 WARN L188 SmtUtils]: Spent 9.20 s on a formula simplification. DAG size of input: 60 DAG size of output: 12 [2019-09-03 19:42:43,699 WARN L188 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2019-09-03 19:43:00,726 WARN L188 SmtUtils]: Spent 4.89 s on a formula simplification. DAG size of input: 48 DAG size of output: 12 [2019-09-03 19:43:03,189 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967290) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967282) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967278) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967276) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-03 19:43:21,489 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-03 19:43:42,092 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967290) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967278) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967276) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-03 19:43:54,581 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-03 19:43:57,004 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967290) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967278) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-03 19:44:13,954 WARN L188 SmtUtils]: Spent 6.55 s on a formula simplification. DAG size of input: 44 DAG size of output: 16 [2019-09-03 19:44:24,136 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967290) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967282) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967278) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967276) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-03 19:45:08,555 WARN L188 SmtUtils]: Spent 5.55 s on a formula simplification. DAG size of input: 48 DAG size of output: 12 [2019-09-03 19:45:31,767 WARN L188 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 52 DAG size of output: 12 [2019-09-03 19:46:15,538 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967290) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967282) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967278) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967276) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-03 19:46:45,727 WARN L188 SmtUtils]: Spent 5.74 s on a formula simplification. DAG size of input: 52 DAG size of output: 12 [2019-09-03 19:47:12,487 WARN L188 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 56 DAG size of output: 12 [2019-09-03 19:47:41,459 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-03 19:47:56,297 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-03 19:48:13,884 WARN L188 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 52 DAG size of output: 12 [2019-09-03 19:48:19,038 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-03 19:48:27,039 WARN L188 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-03 19:48:49,936 WARN L188 SmtUtils]: Spent 7.32 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-03 19:48:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:48:49,937 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2019-09-03 19:48:49,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:48:49,937 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 50 [2019-09-03 19:48:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:48:49,938 INFO L225 Difference]: With dead ends: 126 [2019-09-03 19:48:49,938 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 19:48:49,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 391.6s TimeCoverageRelationStatistics Valid=705, Invalid=2684, Unknown=57, NotChecked=714, Total=4160 [2019-09-03 19:48:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 19:48:49,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 86. [2019-09-03 19:48:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-03 19:48:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2019-09-03 19:48:49,951 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 50 [2019-09-03 19:48:49,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:48:49,951 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2019-09-03 19:48:49,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:48:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2019-09-03 19:48:49,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 19:48:49,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:49,952 INFO L399 BasicCegarLoop]: trace histogram [26, 17, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:49,953 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:49,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:49,953 INFO L82 PathProgramCache]: Analyzing trace with hash 134470616, now seen corresponding path program 13 times [2019-09-03 19:48:49,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:49,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:49,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:49,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:48:49,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 323 proven. 272 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 19:48:50,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:48:50,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:48:50,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:48:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:50,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:48:50,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:48:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 323 proven. 272 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 19:48:50,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:48:50,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-03 19:48:50,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:48:50,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:48:50,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:48:50,388 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand 20 states. [2019-09-03 19:48:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:48:50,804 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2019-09-03 19:48:50,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:48:50,804 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2019-09-03 19:48:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:48:50,805 INFO L225 Difference]: With dead ends: 137 [2019-09-03 19:48:50,805 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 19:48:50,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:48:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 19:48:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-03 19:48:50,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 19:48:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2019-09-03 19:48:50,815 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 62 [2019-09-03 19:48:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:48:50,815 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2019-09-03 19:48:50,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:48:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2019-09-03 19:48:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:48:50,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:50,817 INFO L399 BasicCegarLoop]: trace histogram [27, 18, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:50,817 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:50,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:50,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1670677227, now seen corresponding path program 14 times [2019-09-03 19:48:50,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:50,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:50,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:50,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:48:50,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 342 proven. 306 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 19:48:51,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:48:51,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:48:51,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:48:51,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:48:51,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:48:51,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 19:48:51,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:48:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:48:51,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:48:51,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 30] total 31 [2019-09-03 19:48:51,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:48:51,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:48:51,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:48:51,492 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand 31 states. [2019-09-03 19:48:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:48:52,322 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2019-09-03 19:48:52,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:48:52,324 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-03 19:48:52,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:48:52,325 INFO L225 Difference]: With dead ends: 139 [2019-09-03 19:48:52,326 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 19:48:52,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:48:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 19:48:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-09-03 19:48:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 19:48:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2019-09-03 19:48:52,356 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 64 [2019-09-03 19:48:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:48:52,356 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2019-09-03 19:48:52,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:48:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2019-09-03 19:48:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 19:48:52,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:52,365 INFO L399 BasicCegarLoop]: trace histogram [28, 19, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:52,365 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1250966766, now seen corresponding path program 15 times [2019-09-03 19:48:52,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:52,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:52,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:52,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:48:52,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 361 proven. 342 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 19:48:52,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:48:52,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:48:52,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:48:57,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 19:48:57,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:48:57,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:48:57,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 286 proven. 35 refuted. 1 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-03 19:49:07,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:07,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 28 [2019-09-03 19:49:07,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:49:07,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:49:07,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=652, Unknown=1, NotChecked=0, Total=756 [2019-09-03 19:49:07,729 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand 28 states. [2019-09-03 19:49:12,578 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-03 19:49:23,779 WARN L188 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 19:49:33,111 WARN L188 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-03 19:49:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:36,252 INFO L93 Difference]: Finished difference Result 167 states and 226 transitions. [2019-09-03 19:49:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:49:36,255 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2019-09-03 19:49:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:36,256 INFO L225 Difference]: With dead ends: 167 [2019-09-03 19:49:36,256 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 19:49:36,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=163, Invalid=1025, Unknown=2, NotChecked=0, Total=1190 [2019-09-03 19:49:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 19:49:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2019-09-03 19:49:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 19:49:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2019-09-03 19:49:36,284 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 66 [2019-09-03 19:49:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:36,284 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2019-09-03 19:49:36,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:49:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2019-09-03 19:49:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 19:49:36,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:36,286 INFO L399 BasicCegarLoop]: trace histogram [29, 19, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:36,286 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:36,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:36,287 INFO L82 PathProgramCache]: Analyzing trace with hash 664683021, now seen corresponding path program 16 times [2019-09-03 19:49:36,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:36,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:36,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:36,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 380 proven. 380 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 19:49:36,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:36,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:36,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:49:36,711 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:49:36,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:49:36,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:49:36,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 380 proven. 380 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 19:49:36,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:49:36,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-03 19:49:36,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:49:36,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:49:36,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:49:36,778 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand 23 states. [2019-09-03 19:49:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:37,348 INFO L93 Difference]: Finished difference Result 181 states and 220 transitions. [2019-09-03 19:49:37,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:49:37,350 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2019-09-03 19:49:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:37,351 INFO L225 Difference]: With dead ends: 181 [2019-09-03 19:49:37,351 INFO L226 Difference]: Without dead ends: 113 [2019-09-03 19:49:37,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:49:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-03 19:49:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-09-03 19:49:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 19:49:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2019-09-03 19:49:37,365 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 68 [2019-09-03 19:49:37,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:37,365 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2019-09-03 19:49:37,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:49:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2019-09-03 19:49:37,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 19:49:37,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:37,367 INFO L399 BasicCegarLoop]: trace histogram [30, 20, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:37,367 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:37,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:37,368 INFO L82 PathProgramCache]: Analyzing trace with hash -119193206, now seen corresponding path program 17 times [2019-09-03 19:49:37,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:37,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:37,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:49:37,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 399 proven. 420 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 19:49:37,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:49:37,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:49:37,746 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1