java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init4_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:00:45,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:00:45,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:00:45,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:00:45,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:00:45,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:00:45,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:00:45,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:00:45,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:00:45,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:00:45,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:00:45,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:00:45,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:00:45,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:00:45,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:00:45,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:00:45,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:00:45,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:00:45,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:00:45,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:00:45,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:00:45,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:00:45,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:00:45,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:00:45,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:00:45,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:00:45,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:00:45,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:00:45,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:00:45,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:00:45,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:00:45,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:00:45,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:00:45,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:00:45,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:00:45,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:00:45,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:00:45,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:00:45,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:00:45,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:00:45,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:00:45,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 10:00:45,453 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:00:45,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:00:45,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:00:45,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:00:45,456 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:00:45,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:00:45,456 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:00:45,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:00:45,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:00:45,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:00:45,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:00:45,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:00:45,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:00:45,459 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:00:45,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:00:45,460 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:00:45,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:00:45,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:00:45,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:00:45,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:00:45,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:00:45,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:00:45,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:00:45,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:00:45,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:00:45,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:00:45,462 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:00:45,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:00:45,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:00:45,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:00:45,510 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:00:45,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:00:45,516 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:00:45,516 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:00:45,517 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init4_ground-2.i [2019-09-07 10:00:45,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8598f7be/a1858bfa14584af49cce3e33a95d2406/FLAG4b63b2def [2019-09-07 10:00:46,088 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:00:46,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init4_ground-2.i [2019-09-07 10:00:46,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8598f7be/a1858bfa14584af49cce3e33a95d2406/FLAG4b63b2def [2019-09-07 10:00:46,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8598f7be/a1858bfa14584af49cce3e33a95d2406 [2019-09-07 10:00:46,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:00:46,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:00:46,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:00:46,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:00:46,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:00:46,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:00:46" (1/1) ... [2019-09-07 10:00:46,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f71350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:00:46, skipping insertion in model container [2019-09-07 10:00:46,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:00:46" (1/1) ... [2019-09-07 10:00:46,507 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:00:46,522 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:00:46,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:00:46,711 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:00:46,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:00:46,749 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:00:46,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:00:46 WrapperNode [2019-09-07 10:00:46,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:00:46,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:00:46,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:00:46,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:00:46,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:00:46" (1/1) ... [2019-09-07 10:00:46,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:00:46" (1/1) ... [2019-09-07 10:00:46,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:00:46" (1/1) ... [2019-09-07 10:00:46,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:00:46" (1/1) ... [2019-09-07 10:00:46,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:00:46" (1/1) ... [2019-09-07 10:00:46,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:00:46" (1/1) ... [2019-09-07 10:00:46,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:00:46" (1/1) ... [2019-09-07 10:00:46,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:00:46,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:00:46,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:00:46,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:00:46,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:00:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:00:46,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:00:46,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:00:46,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:00:46,935 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:00:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:00:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:00:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:00:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:00:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:00:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:00:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:00:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:00:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:00:47,177 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:00:47,177 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-07 10:00:47,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:00:47 BoogieIcfgContainer [2019-09-07 10:00:47,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:00:47,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:00:47,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:00:47,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:00:47,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:00:46" (1/3) ... [2019-09-07 10:00:47,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bfaa18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:00:47, skipping insertion in model container [2019-09-07 10:00:47,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:00:46" (2/3) ... [2019-09-07 10:00:47,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bfaa18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:00:47, skipping insertion in model container [2019-09-07 10:00:47,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:00:47" (3/3) ... [2019-09-07 10:00:47,188 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_init4_ground-2.i [2019-09-07 10:00:47,198 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:00:47,207 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:00:47,234 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:00:47,292 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:00:47,293 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:00:47,293 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:00:47,294 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:00:47,294 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:00:47,294 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:00:47,294 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:00:47,295 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:00:47,295 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:00:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-07 10:00:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 10:00:47,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:47,327 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:47,329 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:47,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1568614638, now seen corresponding path program 1 times [2019-09-07 10:00:47,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:47,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:47,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:47,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:00:47,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:00:47,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:00:47,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:00:47,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:00:47,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:00:47,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:00:47,520 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-09-07 10:00:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:47,548 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2019-09-07 10:00:47,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:00:47,549 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-09-07 10:00:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:47,559 INFO L225 Difference]: With dead ends: 51 [2019-09-07 10:00:47,559 INFO L226 Difference]: Without dead ends: 24 [2019-09-07 10:00:47,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:00:47,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-07 10:00:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-07 10:00:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 10:00:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-07 10:00:47,609 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2019-09-07 10:00:47,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:47,610 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-07 10:00:47,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:00:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-07 10:00:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 10:00:47,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:47,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:47,612 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:47,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:47,612 INFO L82 PathProgramCache]: Analyzing trace with hash -395002610, now seen corresponding path program 1 times [2019-09-07 10:00:47,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:47,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:47,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:47,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:00:47,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:00:47,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:00:47,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:00:47,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:00:47,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:00:47,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:00:47,697 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2019-09-07 10:00:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:47,802 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-09-07 10:00:47,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:00:47,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 10:00:47,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:47,805 INFO L225 Difference]: With dead ends: 45 [2019-09-07 10:00:47,805 INFO L226 Difference]: Without dead ends: 28 [2019-09-07 10:00:47,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:00:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-07 10:00:47,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-07 10:00:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:00:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-07 10:00:47,820 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2019-09-07 10:00:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:47,821 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-07 10:00:47,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:00:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-07 10:00:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 10:00:47,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:47,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:47,824 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:47,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:47,825 INFO L82 PathProgramCache]: Analyzing trace with hash 47445068, now seen corresponding path program 1 times [2019-09-07 10:00:47,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:47,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:47,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:00:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:00:47,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:47,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:00:47,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:00:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:48,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:00:48,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 10:00:48,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:48,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:00:48,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:00:48,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:00:48,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:00:48,102 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2019-09-07 10:00:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:48,200 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2019-09-07 10:00:48,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:00:48,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-09-07 10:00:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:48,201 INFO L225 Difference]: With dead ends: 52 [2019-09-07 10:00:48,201 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 10:00:48,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:00:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 10:00:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-07 10:00:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:00:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-07 10:00:48,209 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2019-09-07 10:00:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:48,210 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-07 10:00:48,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:00:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-07 10:00:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:00:48,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:48,211 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:48,212 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:48,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:48,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1810840398, now seen corresponding path program 2 times [2019-09-07 10:00:48,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:48,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:48,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:48,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:00:48,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:00:48,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:48,280 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:00:48,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:00:48,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:00:48,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:00:48,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:00:48,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:00:48,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:48,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:00:48,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:00:48,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:00:48,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:00:48,381 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-09-07 10:00:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:48,481 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2019-09-07 10:00:48,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:00:48,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-09-07 10:00:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:48,482 INFO L225 Difference]: With dead ends: 59 [2019-09-07 10:00:48,483 INFO L226 Difference]: Without dead ends: 36 [2019-09-07 10:00:48,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:00:48,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-07 10:00:48,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-07 10:00:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-07 10:00:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-09-07 10:00:48,491 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 27 [2019-09-07 10:00:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:48,491 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-09-07 10:00:48,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:00:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-09-07 10:00:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 10:00:48,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:48,493 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:48,494 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:48,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:48,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1527698548, now seen corresponding path program 3 times [2019-09-07 10:00:48,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:48,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:48,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:48,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:00:48,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 10:00:48,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:48,580 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-07 10:00:48,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:00:48,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:00:48,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:00:48,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:00:48,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 10:00:48,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:48,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:00:48,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:00:48,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:00:48,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:00:48,677 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 7 states. [2019-09-07 10:00:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:48,755 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-09-07 10:00:48,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:00:48,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-07 10:00:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:48,758 INFO L225 Difference]: With dead ends: 66 [2019-09-07 10:00:48,758 INFO L226 Difference]: Without dead ends: 40 [2019-09-07 10:00:48,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:00:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-07 10:00:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-07 10:00:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 10:00:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-07 10:00:48,766 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2019-09-07 10:00:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:48,767 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-07 10:00:48,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:00:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-07 10:00:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 10:00:48,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:48,768 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:48,768 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:48,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:48,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1451349618, now seen corresponding path program 4 times [2019-09-07 10:00:48,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:48,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:48,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:48,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:00:48,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 10:00:48,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:48,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:00:48,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:00:48,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:00:48,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:00:48,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:00:48,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 10:00:48,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:48,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:00:48,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:00:48,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:00:48,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:00:48,941 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 8 states. [2019-09-07 10:00:49,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:49,044 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-09-07 10:00:49,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:00:49,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-09-07 10:00:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:49,045 INFO L225 Difference]: With dead ends: 73 [2019-09-07 10:00:49,045 INFO L226 Difference]: Without dead ends: 44 [2019-09-07 10:00:49,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:00:49,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-07 10:00:49,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-07 10:00:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 10:00:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-07 10:00:49,063 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 35 [2019-09-07 10:00:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:49,063 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-07 10:00:49,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:00:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-07 10:00:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:00:49,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:49,068 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:49,069 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:49,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:49,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2058629836, now seen corresponding path program 5 times [2019-09-07 10:00:49,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:49,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:49,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:49,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:00:49,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 10:00:49,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:49,206 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-07 10:00:49,233 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:00:49,781 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-07 10:00:49,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:00:49,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:00:49,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 10:00:49,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:49,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 10:00:49,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:00:49,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:00:49,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:00:49,814 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 9 states. [2019-09-07 10:00:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:49,905 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2019-09-07 10:00:49,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 10:00:49,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-09-07 10:00:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:49,907 INFO L225 Difference]: With dead ends: 80 [2019-09-07 10:00:49,907 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 10:00:49,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:00:49,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 10:00:49,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-07 10:00:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 10:00:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-07 10:00:49,915 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 39 [2019-09-07 10:00:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:49,915 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-07 10:00:49,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:00:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-07 10:00:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 10:00:49,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:49,917 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:49,917 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:49,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:49,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1129940942, now seen corresponding path program 6 times [2019-09-07 10:00:49,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:49,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:49,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:49,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:00:49,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-07 10:00:50,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:50,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:00:50,105 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:00:50,425 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-07 10:00:50,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:00:50,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:00:50,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:00:50,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:50,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:00:50,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:00:50,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:00:50,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:00:50,465 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2019-09-07 10:00:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:50,552 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2019-09-07 10:00:50,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:00:50,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-09-07 10:00:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:50,555 INFO L225 Difference]: With dead ends: 87 [2019-09-07 10:00:50,555 INFO L226 Difference]: Without dead ends: 52 [2019-09-07 10:00:50,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:00:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-07 10:00:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-07 10:00:50,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 10:00:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-07 10:00:50,575 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 43 [2019-09-07 10:00:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:50,575 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-07 10:00:50,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:00:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-07 10:00:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 10:00:50,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:50,580 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:50,580 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:50,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:50,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2092627444, now seen corresponding path program 7 times [2019-09-07 10:00:50,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:50,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:50,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:50,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:00:50,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 10:00:50,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:50,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:00:50,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:00:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:50,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:00:50,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 10:00:50,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:50,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:00:50,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:00:50,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:00:50,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:00:50,852 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 11 states. [2019-09-07 10:00:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:50,978 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-09-07 10:00:50,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:00:50,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2019-09-07 10:00:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:50,979 INFO L225 Difference]: With dead ends: 94 [2019-09-07 10:00:50,979 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 10:00:50,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:00:50,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 10:00:50,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-07 10:00:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 10:00:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-07 10:00:50,997 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 47 [2019-09-07 10:00:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:50,998 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-07 10:00:50,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:00:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-07 10:00:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 10:00:51,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:51,003 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:51,003 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:51,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2092520974, now seen corresponding path program 8 times [2019-09-07 10:00:51,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:51,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:51,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:51,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:00:51,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 10:00:51,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:51,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:00:51,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:00:51,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:00:51,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:00:51,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:00:51,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:00:51,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:51,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 10:00:51,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 10:00:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 10:00:51,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:00:51,239 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 12 states. [2019-09-07 10:00:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:51,361 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2019-09-07 10:00:51,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 10:00:51,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-09-07 10:00:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:51,363 INFO L225 Difference]: With dead ends: 101 [2019-09-07 10:00:51,366 INFO L226 Difference]: Without dead ends: 60 [2019-09-07 10:00:51,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:00:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-07 10:00:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-07 10:00:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-07 10:00:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-09-07 10:00:51,380 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 51 [2019-09-07 10:00:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:51,381 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-09-07 10:00:51,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 10:00:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-09-07 10:00:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 10:00:51,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:51,382 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:51,383 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:51,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1825288524, now seen corresponding path program 9 times [2019-09-07 10:00:51,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:51,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:51,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:51,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:00:51,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-07 10:00:51,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:51,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:00:51,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:00:55,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 10:00:55,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:00:55,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:00:55,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-07 10:00:55,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:55,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 10:00:55,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:00:55,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:00:55,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:00:55,648 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 13 states. [2019-09-07 10:00:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:55,750 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2019-09-07 10:00:55,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:00:55,751 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-09-07 10:00:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:55,752 INFO L225 Difference]: With dead ends: 108 [2019-09-07 10:00:55,752 INFO L226 Difference]: Without dead ends: 64 [2019-09-07 10:00:55,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:00:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-07 10:00:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-07 10:00:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 10:00:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-07 10:00:55,764 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 55 [2019-09-07 10:00:55,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:55,765 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-07 10:00:55,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:00:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-07 10:00:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 10:00:55,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:55,768 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:55,768 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:55,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1177185202, now seen corresponding path program 10 times [2019-09-07 10:00:55,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:55,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:55,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:55,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:00:55,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-07 10:00:55,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:55,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:00:55,963 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:00:56,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:00:56,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:00:56,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:00:56,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:00:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:00:56,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:00:56,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:00:56,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:00:56,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:00:56,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:00:56,057 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 14 states. [2019-09-07 10:00:56,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:00:56,159 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2019-09-07 10:00:56,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:00:56,161 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-09-07 10:00:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:00:56,162 INFO L225 Difference]: With dead ends: 115 [2019-09-07 10:00:56,162 INFO L226 Difference]: Without dead ends: 68 [2019-09-07 10:00:56,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:00:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-07 10:00:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-07 10:00:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-07 10:00:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-07 10:00:56,181 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 59 [2019-09-07 10:00:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:00:56,181 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-07 10:00:56,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:00:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-07 10:00:56,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 10:00:56,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:00:56,183 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:00:56,186 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:00:56,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:00:56,187 INFO L82 PathProgramCache]: Analyzing trace with hash 342894732, now seen corresponding path program 11 times [2019-09-07 10:00:56,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:00:56,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:00:56,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:56,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:00:56,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:00:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:00:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-07 10:00:56,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:00:56,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:00:56,367 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:01:10,508 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-07 10:01:10,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:01:10,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:01:10,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:01:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-07 10:01:10,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:01:10,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:01:10,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:01:10,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:01:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:01:10,563 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 15 states. [2019-09-07 10:01:10,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:01:10,669 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2019-09-07 10:01:10,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:01:10,670 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2019-09-07 10:01:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:01:10,671 INFO L225 Difference]: With dead ends: 122 [2019-09-07 10:01:10,671 INFO L226 Difference]: Without dead ends: 72 [2019-09-07 10:01:10,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:01:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-07 10:01:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-07 10:01:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-07 10:01:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-09-07 10:01:10,678 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 63 [2019-09-07 10:01:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:01:10,679 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-09-07 10:01:10,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:01:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-09-07 10:01:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 10:01:10,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:01:10,680 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:01:10,681 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:01:10,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:01:10,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1686898, now seen corresponding path program 12 times [2019-09-07 10:01:10,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:01:10,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:01:10,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:10,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:01:10,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:01:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-09-07 10:01:10,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:01:10,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:01:10,856 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:01:36,501 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 10:01:36,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:01:36,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:01:36,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:01:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 78 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 10:01:36,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:01:36,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2019-09-07 10:01:36,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:01:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:01:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:01:36,609 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 17 states. [2019-09-07 10:01:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:01:36,763 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-09-07 10:01:36,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:01:36,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-09-07 10:01:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:01:36,764 INFO L225 Difference]: With dead ends: 129 [2019-09-07 10:01:36,764 INFO L226 Difference]: Without dead ends: 76 [2019-09-07 10:01:36,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:01:36,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-07 10:01:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-09-07 10:01:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 10:01:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-09-07 10:01:36,773 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 67 [2019-09-07 10:01:36,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:01:36,774 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2019-09-07 10:01:36,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:01:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2019-09-07 10:01:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 10:01:36,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:01:36,775 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:01:36,775 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:01:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:01:36,776 INFO L82 PathProgramCache]: Analyzing trace with hash 106590156, now seen corresponding path program 13 times [2019-09-07 10:01:36,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:01:36,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:01:36,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:36,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:01:36,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:01:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-09-07 10:01:36,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:01:36,933 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:01:36,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:01:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:01:36,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:01:36,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:01:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-09-07 10:01:37,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:01:37,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:01:37,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:01:37,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:01:37,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:01:37,021 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 17 states. [2019-09-07 10:01:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:01:37,148 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2019-09-07 10:01:37,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:01:37,149 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2019-09-07 10:01:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:01:37,150 INFO L225 Difference]: With dead ends: 136 [2019-09-07 10:01:37,150 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 10:01:37,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:01:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 10:01:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-07 10:01:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-07 10:01:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-09-07 10:01:37,158 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 71 [2019-09-07 10:01:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:01:37,158 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-09-07 10:01:37,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:01:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-09-07 10:01:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 10:01:37,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:01:37,159 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:01:37,160 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:01:37,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:01:37,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1965252814, now seen corresponding path program 14 times [2019-09-07 10:01:37,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:01:37,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:01:37,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:37,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:01:37,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:01:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-07 10:01:37,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:01:37,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:01:37,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:01:37,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:01:37,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:01:37,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:01:37,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:01:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-07 10:01:37,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:01:37,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 10:01:37,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:01:37,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:01:37,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:01:37,437 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 18 states. [2019-09-07 10:01:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:01:37,588 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2019-09-07 10:01:37,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:01:37,589 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2019-09-07 10:01:37,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:01:37,591 INFO L225 Difference]: With dead ends: 143 [2019-09-07 10:01:37,591 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 10:01:37,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:01:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 10:01:37,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-09-07 10:01:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-07 10:01:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-09-07 10:01:37,597 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 75 [2019-09-07 10:01:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:01:37,598 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-09-07 10:01:37,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:01:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-09-07 10:01:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 10:01:37,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:01:37,599 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:01:37,600 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:01:37,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:01:37,600 INFO L82 PathProgramCache]: Analyzing trace with hash -38631668, now seen corresponding path program 15 times [2019-09-07 10:01:37,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:01:37,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:01:37,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:37,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:01:37,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:01:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:01:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-09-07 10:01:37,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:01:37,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:01:37,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:02:05,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 10:02:05,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:02:05,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:02:05,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:02:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 120 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-07 10:02:05,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:02:05,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 20 [2019-09-07 10:02:05,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:02:05,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:02:05,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:02:05,530 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 20 states. [2019-09-07 10:02:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:02:05,732 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2019-09-07 10:02:05,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:02:05,732 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2019-09-07 10:02:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:02:05,733 INFO L225 Difference]: With dead ends: 150 [2019-09-07 10:02:05,733 INFO L226 Difference]: Without dead ends: 88 [2019-09-07 10:02:05,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:02:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-07 10:02:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-07 10:02:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 10:02:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-09-07 10:02:05,744 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 79 [2019-09-07 10:02:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:02:05,745 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2019-09-07 10:02:05,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:02:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2019-09-07 10:02:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 10:02:05,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:02:05,746 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:02:05,747 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:02:05,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:02:05,747 INFO L82 PathProgramCache]: Analyzing trace with hash -523964658, now seen corresponding path program 16 times [2019-09-07 10:02:05,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:02:05,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:02:05,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:02:05,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:02:05,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:02:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:02:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-07 10:02:05,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:02:05,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:02:05,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:02:06,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:02:06,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:02:06,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:02:06,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:02:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-07 10:02:06,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:02:06,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 10:02:06,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:02:06,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:02:06,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:02:06,084 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 20 states. [2019-09-07 10:02:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:02:06,230 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2019-09-07 10:02:06,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:02:06,231 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 83 [2019-09-07 10:02:06,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:02:06,232 INFO L225 Difference]: With dead ends: 157 [2019-09-07 10:02:06,232 INFO L226 Difference]: Without dead ends: 92 [2019-09-07 10:02:06,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:02:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-07 10:02:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-09-07 10:02:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-07 10:02:06,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-09-07 10:02:06,238 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 83 [2019-09-07 10:02:06,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:02:06,238 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2019-09-07 10:02:06,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:02:06,239 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2019-09-07 10:02:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 10:02:06,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:02:06,240 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:02:06,240 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:02:06,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:02:06,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1688235596, now seen corresponding path program 17 times [2019-09-07 10:02:06,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:02:06,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:02:06,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:02:06,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:02:06,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:02:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:02:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-09-07 10:02:06,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:02:06,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:02:06,498 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:03:19,545 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-07 10:03:19,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:03:19,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:03:19,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:03:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-09-07 10:03:19,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:03:19,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 10:03:19,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:03:19,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:03:19,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:03:19,641 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 21 states. [2019-09-07 10:03:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:03:19,810 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2019-09-07 10:03:19,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:03:19,812 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-09-07 10:03:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:03:19,813 INFO L225 Difference]: With dead ends: 164 [2019-09-07 10:03:19,813 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 10:03:19,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:03:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 10:03:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-07 10:03:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-07 10:03:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-09-07 10:03:19,820 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 87 [2019-09-07 10:03:19,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:03:19,821 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-09-07 10:03:19,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:03:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2019-09-07 10:03:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 10:03:19,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:03:19,822 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:03:19,822 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:03:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:03:19,822 INFO L82 PathProgramCache]: Analyzing trace with hash 721612110, now seen corresponding path program 18 times [2019-09-07 10:03:19,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:03:19,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:03:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:03:19,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:03:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:03:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:03:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-07 10:03:20,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:03:20,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:03:20,078 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:03:46,160 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-07 10:03:46,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:03:46,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:03:46,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:03:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-07 10:03:46,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:03:46,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:03:46,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:03:46,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:03:46,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:03:46,216 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 22 states. [2019-09-07 10:03:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:03:46,349 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2019-09-07 10:03:46,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:03:46,349 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 91 [2019-09-07 10:03:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:03:46,350 INFO L225 Difference]: With dead ends: 171 [2019-09-07 10:03:46,350 INFO L226 Difference]: Without dead ends: 100 [2019-09-07 10:03:46,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:03:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-07 10:03:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-09-07 10:03:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-07 10:03:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-09-07 10:03:46,356 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 91 [2019-09-07 10:03:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:03:46,357 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-09-07 10:03:46,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:03:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-09-07 10:03:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 10:03:46,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:03:46,358 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:03:46,358 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:03:46,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:03:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash -733207156, now seen corresponding path program 19 times [2019-09-07 10:03:46,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:03:46,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:03:46,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:03:46,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:03:46,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:03:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:03:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-07 10:03:46,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:03:46,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:03:46,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:03:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:03:46,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:03:46,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:03:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-07 10:03:46,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:03:46,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 10:03:46,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:03:46,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:03:46,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:03:46,764 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 23 states. [2019-09-07 10:03:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:03:46,940 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2019-09-07 10:03:46,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:03:46,943 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 95 [2019-09-07 10:03:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:03:46,944 INFO L225 Difference]: With dead ends: 178 [2019-09-07 10:03:46,944 INFO L226 Difference]: Without dead ends: 104 [2019-09-07 10:03:46,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:03:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-07 10:03:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-07 10:03:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-07 10:03:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-09-07 10:03:46,950 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 95 [2019-09-07 10:03:46,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:03:46,950 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-09-07 10:03:46,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:03:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-09-07 10:03:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 10:03:46,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:03:46,952 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:03:46,952 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:03:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:03:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash -585802866, now seen corresponding path program 20 times [2019-09-07 10:03:46,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:03:46,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:03:46,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:03:46,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:03:46,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:03:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:03:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-07 10:03:47,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:03:47,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:03:47,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:03:47,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:03:47,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:03:47,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:03:47,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:03:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:03:47,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:03:47,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 10:03:47,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:03:47,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:03:47,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:03:47,439 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 24 states. [2019-09-07 10:03:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:03:47,654 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2019-09-07 10:03:47,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:03:47,654 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2019-09-07 10:03:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:03:47,655 INFO L225 Difference]: With dead ends: 185 [2019-09-07 10:03:47,655 INFO L226 Difference]: Without dead ends: 108 [2019-09-07 10:03:47,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:03:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-07 10:03:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-09-07 10:03:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-07 10:03:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2019-09-07 10:03:47,661 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 99 [2019-09-07 10:03:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:03:47,661 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2019-09-07 10:03:47,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:03:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2019-09-07 10:03:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 10:03:47,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:03:47,663 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:03:47,663 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:03:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:03:47,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1797411636, now seen corresponding path program 21 times [2019-09-07 10:03:47,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:03:47,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:03:47,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:03:47,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:03:47,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:03:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:03:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-09-07 10:03:47,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:03:47,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:03:47,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:04:22,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 10:04:22,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:04:22,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 10:04:22,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:04:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-09-07 10:04:22,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:04:22,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:04:22,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:04:22,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:04:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:04:22,824 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 25 states. [2019-09-07 10:04:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:04:23,029 INFO L93 Difference]: Finished difference Result 192 states and 203 transitions. [2019-09-07 10:04:23,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:04:23,029 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 103 [2019-09-07 10:04:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:04:23,030 INFO L225 Difference]: With dead ends: 192 [2019-09-07 10:04:23,030 INFO L226 Difference]: Without dead ends: 112 [2019-09-07 10:04:23,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:04:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-07 10:04:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-07 10:04:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 10:04:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2019-09-07 10:04:23,036 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 103 [2019-09-07 10:04:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:04:23,036 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2019-09-07 10:04:23,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:04:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2019-09-07 10:04:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 10:04:23,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:04:23,038 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:04:23,038 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:04:23,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:04:23,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1590412850, now seen corresponding path program 22 times [2019-09-07 10:04:23,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:04:23,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:04:23,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:23,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:04:23,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:04:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-09-07 10:04:23,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:04:23,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:04:23,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:04:23,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:04:23,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:04:23,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:04:23,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:04:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-09-07 10:04:23,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:04:23,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 10:04:23,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:04:23,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:04:23,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:04:23,455 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 26 states. [2019-09-07 10:04:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:04:23,687 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2019-09-07 10:04:23,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:04:23,688 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 107 [2019-09-07 10:04:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:04:23,689 INFO L225 Difference]: With dead ends: 199 [2019-09-07 10:04:23,689 INFO L226 Difference]: Without dead ends: 116 [2019-09-07 10:04:23,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:04:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-07 10:04:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-09-07 10:04:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-07 10:04:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2019-09-07 10:04:23,709 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 107 [2019-09-07 10:04:23,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:04:23,709 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2019-09-07 10:04:23,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:04:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2019-09-07 10:04:23,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 10:04:23,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:04:23,711 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:04:23,711 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:04:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:04:23,711 INFO L82 PathProgramCache]: Analyzing trace with hash 494732300, now seen corresponding path program 23 times [2019-09-07 10:04:23,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:04:23,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:04:23,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:23,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:04:23,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:04:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:04:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2019-09-07 10:04:24,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:04:24,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:04:24,053 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:06:02,917 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-07 10:06:02,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:06:03,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:06:03,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:06:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2019-09-07 10:06:03,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:06:03,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:06:03,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:06:03,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:06:03,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:06:03,120 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 27 states. [2019-09-07 10:06:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:06:03,273 INFO L93 Difference]: Finished difference Result 206 states and 217 transitions. [2019-09-07 10:06:03,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:06:03,274 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 111 [2019-09-07 10:06:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:06:03,275 INFO L225 Difference]: With dead ends: 206 [2019-09-07 10:06:03,275 INFO L226 Difference]: Without dead ends: 120 [2019-09-07 10:06:03,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:06:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-07 10:06:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-07 10:06:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-07 10:06:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2019-09-07 10:06:03,282 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 111 [2019-09-07 10:06:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:06:03,283 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2019-09-07 10:06:03,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:06:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2019-09-07 10:06:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-07 10:06:03,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:06:03,284 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:06:03,284 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:06:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:06:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1030256626, now seen corresponding path program 24 times [2019-09-07 10:06:03,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:06:03,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:06:03,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:06:03,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:06:03,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:06:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:06:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-07 10:06:03,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:06:03,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:06:03,674 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:07:34,824 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:07:34,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:07:34,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:07:34,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:07:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-09-07 10:07:34,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:07:34,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 10:07:34,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:07:34,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:07:34,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:07:34,918 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand 28 states. [2019-09-07 10:07:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:07:35,121 INFO L93 Difference]: Finished difference Result 213 states and 224 transitions. [2019-09-07 10:07:35,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:07:35,122 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 115 [2019-09-07 10:07:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:07:35,123 INFO L225 Difference]: With dead ends: 213 [2019-09-07 10:07:35,123 INFO L226 Difference]: Without dead ends: 124 [2019-09-07 10:07:35,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:07:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-07 10:07:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-09-07 10:07:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-07 10:07:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2019-09-07 10:07:35,130 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 115 [2019-09-07 10:07:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:07:35,130 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2019-09-07 10:07:35,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:07:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2019-09-07 10:07:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 10:07:35,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:07:35,132 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:07:35,132 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:07:35,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:07:35,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1806554292, now seen corresponding path program 25 times [2019-09-07 10:07:35,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:07:35,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:07:35,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:07:35,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:07:35,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:07:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:07:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2019-09-07 10:07:35,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:07:35,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:07:35,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:07:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:07:35,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:07:35,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:07:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2019-09-07 10:07:35,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:07:35,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:07:35,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:07:35,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:07:35,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:07:35,663 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 29 states. [2019-09-07 10:07:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:07:35,886 INFO L93 Difference]: Finished difference Result 220 states and 231 transitions. [2019-09-07 10:07:35,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:07:35,887 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 119 [2019-09-07 10:07:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:07:35,888 INFO L225 Difference]: With dead ends: 220 [2019-09-07 10:07:35,888 INFO L226 Difference]: Without dead ends: 128 [2019-09-07 10:07:35,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:07:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-07 10:07:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-07 10:07:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-07 10:07:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2019-09-07 10:07:35,910 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 119 [2019-09-07 10:07:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:07:35,910 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2019-09-07 10:07:35,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:07:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2019-09-07 10:07:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 10:07:35,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:07:35,912 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:07:35,912 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:07:35,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:07:35,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1384692146, now seen corresponding path program 26 times [2019-09-07 10:07:35,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:07:35,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:07:35,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:07:35,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:07:35,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:07:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:07:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 1053 trivial. 0 not checked. [2019-09-07 10:07:36,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:07:36,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:07:36,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:07:36,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:07:36,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:07:36,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:07:36,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:07:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 1053 trivial. 0 not checked. [2019-09-07 10:07:36,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:07:36,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 10:07:36,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:07:36,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:07:36,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:07:36,541 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand 30 states. [2019-09-07 10:07:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:07:36,774 INFO L93 Difference]: Finished difference Result 227 states and 238 transitions. [2019-09-07 10:07:36,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 10:07:36,774 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 123 [2019-09-07 10:07:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:07:36,776 INFO L225 Difference]: With dead ends: 227 [2019-09-07 10:07:36,776 INFO L226 Difference]: Without dead ends: 132 [2019-09-07 10:07:36,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:07:36,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-07 10:07:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-09-07 10:07:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-07 10:07:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2019-09-07 10:07:36,786 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 123 [2019-09-07 10:07:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:07:36,787 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2019-09-07 10:07:36,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:07:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2019-09-07 10:07:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 10:07:36,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:07:36,789 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:07:36,789 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:07:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:07:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1317347980, now seen corresponding path program 27 times [2019-09-07 10:07:36,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:07:36,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:07:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:07:36,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:07:36,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:07:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:07:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1134 trivial. 0 not checked. [2019-09-07 10:07:37,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:07:37,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:07:37,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:09:07,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-07 10:09:07,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:09:07,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:09:07,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:09:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 27 proven. 378 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-09-07 10:09:07,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:09:07,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 32 [2019-09-07 10:09:07,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:09:07,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:09:07,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:09:07,264 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 32 states. [2019-09-07 10:09:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:09:07,517 INFO L93 Difference]: Finished difference Result 234 states and 245 transitions. [2019-09-07 10:09:07,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:09:07,518 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2019-09-07 10:09:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:09:07,519 INFO L225 Difference]: With dead ends: 234 [2019-09-07 10:09:07,520 INFO L226 Difference]: Without dead ends: 136 [2019-09-07 10:09:07,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:09:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-07 10:09:07,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-09-07 10:09:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-07 10:09:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2019-09-07 10:09:07,534 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 127 [2019-09-07 10:09:07,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:09:07,535 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2019-09-07 10:09:07,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:09:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2019-09-07 10:09:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 10:09:07,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:09:07,537 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:09:07,537 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:09:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:09:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1863021710, now seen corresponding path program 28 times [2019-09-07 10:09:07,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:09:07,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:09:07,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:07,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:09:07,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:09:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2019-09-07 10:09:08,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:09:08,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:09:08,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:09:08,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:09:08,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:09:08,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:09:08,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:09:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:09:08,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:09:08,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 10:09:08,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:09:08,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:09:08,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:09:08,353 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand 32 states. [2019-09-07 10:09:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:09:08,613 INFO L93 Difference]: Finished difference Result 241 states and 252 transitions. [2019-09-07 10:09:08,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:09:08,614 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 131 [2019-09-07 10:09:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:09:08,615 INFO L225 Difference]: With dead ends: 241 [2019-09-07 10:09:08,615 INFO L226 Difference]: Without dead ends: 140 [2019-09-07 10:09:08,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:09:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-07 10:09:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-09-07 10:09:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-07 10:09:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2019-09-07 10:09:08,623 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 131 [2019-09-07 10:09:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:09:08,624 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2019-09-07 10:09:08,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:09:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2019-09-07 10:09:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-07 10:09:08,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:09:08,625 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:09:08,626 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:09:08,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:09:08,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1346234828, now seen corresponding path program 29 times [2019-09-07 10:09:08,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:09:08,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:09:08,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:08,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:09:08,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:09:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2019-09-07 10:09:09,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:09:09,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:09:09,223 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:11:23,935 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-07 10:11:23,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:11:24,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:11:24,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:11:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2019-09-07 10:11:24,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:11:24,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 10:11:24,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:11:24,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:11:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:11:24,068 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 33 states. [2019-09-07 10:11:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:11:24,310 INFO L93 Difference]: Finished difference Result 248 states and 259 transitions. [2019-09-07 10:11:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:11:24,310 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 135 [2019-09-07 10:11:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:11:24,312 INFO L225 Difference]: With dead ends: 248 [2019-09-07 10:11:24,312 INFO L226 Difference]: Without dead ends: 144 [2019-09-07 10:11:24,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:11:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-07 10:11:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-07 10:11:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-07 10:11:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2019-09-07 10:11:24,319 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 135 [2019-09-07 10:11:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:11:24,320 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2019-09-07 10:11:24,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:11:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2019-09-07 10:11:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-07 10:11:24,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:11:24,321 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:11:24,321 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:11:24,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:11:24,322 INFO L82 PathProgramCache]: Analyzing trace with hash 898372302, now seen corresponding path program 30 times [2019-09-07 10:11:24,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:11:24,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:11:24,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:11:24,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:11:24,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:11:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:11:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2019-09-07 10:11:24,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:11:24,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:11:25,008 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:13:16,536 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-07 10:13:16,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:13:16,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:13:16,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2019-09-07 10:13:16,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:16,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 10:13:16,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:13:16,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:13:16,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:13:16,659 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand 34 states. [2019-09-07 10:13:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:16,983 INFO L93 Difference]: Finished difference Result 255 states and 266 transitions. [2019-09-07 10:13:16,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:13:16,983 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 139 [2019-09-07 10:13:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:16,985 INFO L225 Difference]: With dead ends: 255 [2019-09-07 10:13:16,985 INFO L226 Difference]: Without dead ends: 148 [2019-09-07 10:13:16,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:13:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-07 10:13:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-09-07 10:13:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-07 10:13:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2019-09-07 10:13:17,002 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 139 [2019-09-07 10:13:17,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:17,003 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2019-09-07 10:13:17,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:13:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2019-09-07 10:13:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 10:13:17,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:17,005 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:17,005 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:17,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:17,006 INFO L82 PathProgramCache]: Analyzing trace with hash -861634292, now seen corresponding path program 31 times [2019-09-07 10:13:17,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:17,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:17,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:17,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:13:17,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2019-09-07 10:13:17,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:17,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:17,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:13:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:17,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:13:17,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2019-09-07 10:13:18,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:18,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 10:13:18,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:13:18,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:13:18,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:13:18,009 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand 35 states. [2019-09-07 10:13:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:18,265 INFO L93 Difference]: Finished difference Result 262 states and 273 transitions. [2019-09-07 10:13:18,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:13:18,266 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 143 [2019-09-07 10:13:18,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:18,267 INFO L225 Difference]: With dead ends: 262 [2019-09-07 10:13:18,267 INFO L226 Difference]: Without dead ends: 152 [2019-09-07 10:13:18,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:13:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-07 10:13:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-07 10:13:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-07 10:13:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2019-09-07 10:13:18,276 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 143 [2019-09-07 10:13:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:18,277 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2019-09-07 10:13:18,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:13:18,277 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2019-09-07 10:13:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 10:13:18,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:18,278 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:18,278 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:18,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:18,279 INFO L82 PathProgramCache]: Analyzing trace with hash -802086642, now seen corresponding path program 32 times [2019-09-07 10:13:18,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:18,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:18,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:18,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:13:18,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 1584 trivial. 0 not checked. [2019-09-07 10:13:18,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:18,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:18,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:13:19,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:13:19,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:13:19,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 10:13:19,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 1584 trivial. 0 not checked. [2019-09-07 10:13:19,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:19,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 10:13:19,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 10:13:19,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 10:13:19,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:13:19,057 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 36 states. [2019-09-07 10:13:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:19,357 INFO L93 Difference]: Finished difference Result 269 states and 280 transitions. [2019-09-07 10:13:19,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:13:19,358 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 147 [2019-09-07 10:13:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:19,359 INFO L225 Difference]: With dead ends: 269 [2019-09-07 10:13:19,359 INFO L226 Difference]: Without dead ends: 156 [2019-09-07 10:13:19,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:13:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-07 10:13:19,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-09-07 10:13:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-07 10:13:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2019-09-07 10:13:19,367 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 147 [2019-09-07 10:13:19,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:19,367 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2019-09-07 10:13:19,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 10:13:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2019-09-07 10:13:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-07 10:13:19,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:19,368 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:13:19,368 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:19,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:19,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1511987124, now seen corresponding path program 33 times [2019-09-07 10:13:19,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:19,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:19,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:19,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:13:19,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2019-09-07 10:13:20,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:20,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:20,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:15:07,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-07 10:15:07,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:07,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 10:15:07,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2019-09-07 10:15:07,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:07,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-07 10:15:07,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 10:15:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 10:15:07,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:15:07,412 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand 37 states. [2019-09-07 10:15:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:07,731 INFO L93 Difference]: Finished difference Result 276 states and 287 transitions. [2019-09-07 10:15:07,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 10:15:07,731 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 151 [2019-09-07 10:15:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:07,733 INFO L225 Difference]: With dead ends: 276 [2019-09-07 10:15:07,733 INFO L226 Difference]: Without dead ends: 160 [2019-09-07 10:15:07,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:15:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-07 10:15:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-07 10:15:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-07 10:15:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2019-09-07 10:15:07,740 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 151 [2019-09-07 10:15:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:07,740 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2019-09-07 10:15:07,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 10:15:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2019-09-07 10:15:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-07 10:15:07,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:07,741 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:07,741 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:07,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:07,742 INFO L82 PathProgramCache]: Analyzing trace with hash 791846734, now seen corresponding path program 34 times [2019-09-07 10:15:07,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:07,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:07,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:07,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:07,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2019-09-07 10:15:08,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:08,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:15:08,503 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:08,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:15:08,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:08,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:15:08,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 1785 trivial. 0 not checked. [2019-09-07 10:15:08,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:08,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-07 10:15:08,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 10:15:08,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 10:15:08,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:15:08,637 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand 38 states. [2019-09-07 10:15:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:09,048 INFO L93 Difference]: Finished difference Result 283 states and 294 transitions. [2019-09-07 10:15:09,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:15:09,048 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 155 [2019-09-07 10:15:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:09,049 INFO L225 Difference]: With dead ends: 283 [2019-09-07 10:15:09,050 INFO L226 Difference]: Without dead ends: 164 [2019-09-07 10:15:09,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:15:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-07 10:15:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-09-07 10:15:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-07 10:15:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2019-09-07 10:15:09,058 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 155 [2019-09-07 10:15:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:09,058 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2019-09-07 10:15:09,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 10:15:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2019-09-07 10:15:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 10:15:09,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:09,060 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:15:09,060 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:09,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:09,060 INFO L82 PathProgramCache]: Analyzing trace with hash -316989556, now seen corresponding path program 35 times [2019-09-07 10:15:09,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:09,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:09,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:09,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:09,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 1890 trivial. 0 not checked. [2019-09-07 10:15:09,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:09,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:09,657 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1