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_copy8_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:56:12,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:56:12,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:56:12,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:56:12,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:56:12,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:56:12,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:56:12,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:56:12,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:56:12,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:56:12,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:56:12,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:56:12,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:56:12,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:56:12,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:56:12,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:56:12,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:56:12,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:56:12,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:56:12,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:56:12,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:56:12,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:56:12,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:56:12,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:56:12,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:56:12,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:56:12,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:56:12,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:56:12,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:56:12,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:56:12,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:56:12,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:56:12,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:56:12,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:56:12,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:56:12,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:56:12,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:56:12,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:56:12,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:56:12,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:56:12,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:56:12,414 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-10-01 22:56:12,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:56:12,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:56:12,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:56:12,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:56:12,435 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:56:12,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:56:12,436 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:56:12,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:56:12,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:56:12,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:56:12,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:56:12,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:56:12,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:56:12,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:56:12,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:56:12,438 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:56:12,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:56:12,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:56:12,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:56:12,439 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:56:12,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:56:12,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:56:12,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:56:12,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:56:12,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:56:12,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:56:12,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:56:12,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:56:12,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:56:12,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:56:12,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:56:12,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:56:12,489 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:56:12,489 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:56:12,490 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy8_ground-2.i [2019-10-01 22:56:12,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4f049c9/549064fbc3aa4865bba0ce9c1fd54ad1/FLAGc9ed4e664 [2019-10-01 22:56:13,057 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:56:13,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy8_ground-2.i [2019-10-01 22:56:13,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4f049c9/549064fbc3aa4865bba0ce9c1fd54ad1/FLAGc9ed4e664 [2019-10-01 22:56:13,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4f049c9/549064fbc3aa4865bba0ce9c1fd54ad1 [2019-10-01 22:56:13,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:56:13,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:56:13,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:56:13,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:56:13,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:56:13,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:56:13" (1/1) ... [2019-10-01 22:56:13,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774ea263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:13, skipping insertion in model container [2019-10-01 22:56:13,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:56:13" (1/1) ... [2019-10-01 22:56:13,448 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:56:13,466 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:56:13,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:56:13,651 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:56:13,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:56:13,809 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:56:13,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:13 WrapperNode [2019-10-01 22:56:13,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:56:13,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:56:13,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:56:13,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:56:13,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:13" (1/1) ... [2019-10-01 22:56:13,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:13" (1/1) ... [2019-10-01 22:56:13,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:13" (1/1) ... [2019-10-01 22:56:13,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:13" (1/1) ... [2019-10-01 22:56:13,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:13" (1/1) ... [2019-10-01 22:56:13,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:13" (1/1) ... [2019-10-01 22:56:13,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:13" (1/1) ... [2019-10-01 22:56:13,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:56:13,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:56:13,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:56:13,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:56:13,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:56:13,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:56:13,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:56:13,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:56:13,918 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:56:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:56:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:56:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:56:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:56:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:56:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:56:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:56:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:56:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:56:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:56:14,405 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:56:14,405 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-01 22:56:14,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:56:14 BoogieIcfgContainer [2019-10-01 22:56:14,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:56:14,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:56:14,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:56:14,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:56:14,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:56:13" (1/3) ... [2019-10-01 22:56:14,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a60862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:56:14, skipping insertion in model container [2019-10-01 22:56:14,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:56:13" (2/3) ... [2019-10-01 22:56:14,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a60862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:56:14, skipping insertion in model container [2019-10-01 22:56:14,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:56:14" (3/3) ... [2019-10-01 22:56:14,416 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy8_ground-2.i [2019-10-01 22:56:14,435 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:56:14,442 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:56:14,458 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:56:14,488 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:56:14,489 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:56:14,489 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:56:14,489 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:56:14,489 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:56:14,489 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:56:14,489 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:56:14,489 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:56:14,490 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:56:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-10-01 22:56:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 22:56:14,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:14,516 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:14,518 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:14,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:14,523 INFO L82 PathProgramCache]: Analyzing trace with hash 661673386, now seen corresponding path program 1 times [2019-10-01 22:56:14,525 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:14,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:14,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:14,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:14,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:56:14,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:56:14,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:56:14,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:56:14,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:56:14,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:56:14,723 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2019-10-01 22:56:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:14,755 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2019-10-01 22:56:14,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:56:14,757 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2019-10-01 22:56:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:14,767 INFO L225 Difference]: With dead ends: 88 [2019-10-01 22:56:14,767 INFO L226 Difference]: Without dead ends: 43 [2019-10-01 22:56:14,772 INFO L640 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-10-01 22:56:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-01 22:56:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-01 22:56:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 22:56:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-10-01 22:56:14,823 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2019-10-01 22:56:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:14,823 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-10-01 22:56:14,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:56:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-10-01 22:56:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 22:56:14,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:14,826 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:14,826 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:14,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:14,827 INFO L82 PathProgramCache]: Analyzing trace with hash 904564754, now seen corresponding path program 1 times [2019-10-01 22:56:14,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:14,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:14,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:56:14,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:56:14,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:56:14,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:56:14,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:56:14,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:56:14,957 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 3 states. [2019-10-01 22:56:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:15,002 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2019-10-01 22:56:15,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:56:15,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-01 22:56:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:15,006 INFO L225 Difference]: With dead ends: 80 [2019-10-01 22:56:15,007 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 22:56:15,009 INFO L640 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-10-01 22:56:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 22:56:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-01 22:56:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-01 22:56:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-10-01 22:56:15,030 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 29 [2019-10-01 22:56:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:15,031 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-10-01 22:56:15,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:56:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-10-01 22:56:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 22:56:15,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:15,034 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:15,035 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:15,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1833019696, now seen corresponding path program 1 times [2019-10-01 22:56:15,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:15,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:15,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:15,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:56:15,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:56:15,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:56:15,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:56:15,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:56:15,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:56:15,158 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2019-10-01 22:56:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:15,306 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2019-10-01 22:56:15,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:56:15,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-01 22:56:15,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:15,308 INFO L225 Difference]: With dead ends: 92 [2019-10-01 22:56:15,308 INFO L226 Difference]: Without dead ends: 60 [2019-10-01 22:56:15,309 INFO L640 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-10-01 22:56:15,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-01 22:56:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-10-01 22:56:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 22:56:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2019-10-01 22:56:15,320 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 31 [2019-10-01 22:56:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:15,322 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2019-10-01 22:56:15,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:56:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2019-10-01 22:56:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 22:56:15,327 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:15,328 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:15,328 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:15,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1518385952, now seen corresponding path program 1 times [2019-10-01 22:56:15,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:15,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:15,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:15,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:15,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 22:56:15,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:15,474 INFO L224 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-10-01 22:56:15,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:15,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:56:15,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:56:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 22:56:15,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:56:15,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-01 22:56:15,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:56:15,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:56:15,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:56:15,671 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 6 states. [2019-10-01 22:56:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:15,903 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2019-10-01 22:56:15,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:56:15,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-01 22:56:15,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:15,905 INFO L225 Difference]: With dead ends: 122 [2019-10-01 22:56:15,905 INFO L226 Difference]: Without dead ends: 79 [2019-10-01 22:56:15,906 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:56:15,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-01 22:56:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2019-10-01 22:56:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-01 22:56:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2019-10-01 22:56:15,917 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 47 [2019-10-01 22:56:15,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:15,917 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2019-10-01 22:56:15,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:56:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2019-10-01 22:56:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 22:56:15,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:15,919 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:15,919 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:15,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:15,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1765015214, now seen corresponding path program 2 times [2019-10-01 22:56:15,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:15,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:15,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:15,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:15,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-01 22:56:16,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:16,023 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:56:16,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:56:16,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:56:16,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:56:16,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:56:16,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:56:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-01 22:56:16,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:56:16,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:56:16,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:56:16,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:56:16,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:56:16,145 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 6 states. [2019-10-01 22:56:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:16,182 INFO L93 Difference]: Finished difference Result 132 states and 150 transitions. [2019-10-01 22:56:16,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:56:16,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-01 22:56:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:16,185 INFO L225 Difference]: With dead ends: 132 [2019-10-01 22:56:16,186 INFO L226 Difference]: Without dead ends: 73 [2019-10-01 22:56:16,186 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 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-10-01 22:56:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-01 22:56:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-10-01 22:56:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-01 22:56:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-10-01 22:56:16,205 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 65 [2019-10-01 22:56:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:16,206 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-10-01 22:56:16,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:56:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-10-01 22:56:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 22:56:16,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:16,208 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:16,208 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:16,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:16,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1302503220, now seen corresponding path program 3 times [2019-10-01 22:56:16,210 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:16,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:16,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:16,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:56:16,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-01 22:56:16,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:16,373 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:56:16,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:56:16,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:56:16,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:56:16,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:56:16,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:56:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:56:16,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:56:16,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-01 22:56:16,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:56:16,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:56:16,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:56:16,513 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 9 states. [2019-10-01 22:56:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:16,835 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2019-10-01 22:56:16,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:56:16,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-10-01 22:56:16,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:16,837 INFO L225 Difference]: With dead ends: 158 [2019-10-01 22:56:16,837 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 22:56:16,838 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:56:16,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 22:56:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2019-10-01 22:56:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-01 22:56:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-10-01 22:56:16,850 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 67 [2019-10-01 22:56:16,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:16,852 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-10-01 22:56:16,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:56:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-10-01 22:56:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-01 22:56:16,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:16,854 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:16,855 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:16,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2145096026, now seen corresponding path program 4 times [2019-10-01 22:56:16,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:16,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:16,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:16,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:56:16,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-01 22:56:17,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:17,031 INFO L224 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-10-01 22:56:17,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:56:17,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:56:17,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:56:17,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:56:17,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:56:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-01 22:56:17,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:56:17,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-01 22:56:17,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:56:17,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:56:17,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:56:17,220 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 11 states. [2019-10-01 22:56:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:17,525 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2019-10-01 22:56:17,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:56:17,525 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2019-10-01 22:56:17,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:17,527 INFO L225 Difference]: With dead ends: 192 [2019-10-01 22:56:17,527 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 22:56:17,528 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:56:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 22:56:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-10-01 22:56:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-01 22:56:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2019-10-01 22:56:17,539 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 85 [2019-10-01 22:56:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:17,540 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2019-10-01 22:56:17,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:56:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2019-10-01 22:56:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-01 22:56:17,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:17,542 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:17,542 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash -613385624, now seen corresponding path program 5 times [2019-10-01 22:56:17,543 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:17,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:17,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:56:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 22:56:17,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:17,669 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:56:17,694 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:56:44,972 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:56:44,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:56:44,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:56:44,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:56:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 22:56:45,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:56:45,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:56:45,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:56:45,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:56:45,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:56:45,058 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 8 states. [2019-10-01 22:56:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:45,306 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2019-10-01 22:56:45,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:56:45,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-10-01 22:56:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:45,308 INFO L225 Difference]: With dead ends: 213 [2019-10-01 22:56:45,308 INFO L226 Difference]: Without dead ends: 132 [2019-10-01 22:56:45,309 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 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-10-01 22:56:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-01 22:56:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2019-10-01 22:56:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-01 22:56:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2019-10-01 22:56:45,321 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 103 [2019-10-01 22:56:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:45,321 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2019-10-01 22:56:45,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:56:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2019-10-01 22:56:45,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-01 22:56:45,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:45,323 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:45,324 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:45,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1183915096, now seen corresponding path program 6 times [2019-10-01 22:56:45,324 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:45,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:45,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:45,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:56:45,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-01 22:56:45,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:45,487 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:56:45,517 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:56:50,712 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-10-01 22:56:50,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:56:50,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:56:50,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:56:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-01 22:56:50,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:56:50,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 22:56:50,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:56:50,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:56:50,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:56:50,763 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 9 states. [2019-10-01 22:56:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:51,032 INFO L93 Difference]: Finished difference Result 243 states and 267 transitions. [2019-10-01 22:56:51,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:56:51,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-10-01 22:56:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:51,034 INFO L225 Difference]: With dead ends: 243 [2019-10-01 22:56:51,035 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 22:56:51,036 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 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-10-01 22:56:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 22:56:51,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2019-10-01 22:56:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-01 22:56:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2019-10-01 22:56:51,047 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 119 [2019-10-01 22:56:51,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:51,048 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2019-10-01 22:56:51,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:56:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2019-10-01 22:56:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-01 22:56:51,054 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:51,054 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:51,055 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:51,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:51,055 INFO L82 PathProgramCache]: Analyzing trace with hash 961453640, now seen corresponding path program 7 times [2019-10-01 22:56:51,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:51,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:51,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:51,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:56:51,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-10-01 22:56:51,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:51,253 INFO L224 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-10-01 22:56:51,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:51,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:56:51,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:56:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:56:51,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:56:51,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-10-01 22:56:51,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:56:51,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:56:51,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:56:51,490 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 15 states. [2019-10-01 22:56:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:51,879 INFO L93 Difference]: Finished difference Result 290 states and 316 transitions. [2019-10-01 22:56:51,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:56:51,880 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 135 [2019-10-01 22:56:51,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:51,881 INFO L225 Difference]: With dead ends: 290 [2019-10-01 22:56:51,882 INFO L226 Difference]: Without dead ends: 167 [2019-10-01 22:56:51,883 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:56:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-01 22:56:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-10-01 22:56:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-01 22:56:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2019-10-01 22:56:51,906 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 135 [2019-10-01 22:56:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:51,906 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2019-10-01 22:56:51,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:56:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2019-10-01 22:56:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-01 22:56:51,914 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:51,914 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:51,914 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:51,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:51,915 INFO L82 PathProgramCache]: Analyzing trace with hash 33613782, now seen corresponding path program 8 times [2019-10-01 22:56:51,915 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:51,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:51,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:51,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:56:51,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:56:52,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:52,076 INFO L224 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-10-01 22:56:52,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:56:52,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:56:52,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:56:52,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:56:52,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:56:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:56:52,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:56:52,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 22:56:52,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:56:52,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:56:52,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:56:52,296 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 10 states. [2019-10-01 22:56:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:56:52,348 INFO L93 Difference]: Finished difference Result 300 states and 318 transitions. [2019-10-01 22:56:52,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:56:52,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-10-01 22:56:52,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:56:52,350 INFO L225 Difference]: With dead ends: 300 [2019-10-01 22:56:52,350 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 22:56:52,351 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 153 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-10-01 22:56:52,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 22:56:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-10-01 22:56:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-01 22:56:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2019-10-01 22:56:52,359 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 153 [2019-10-01 22:56:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:56:52,359 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2019-10-01 22:56:52,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:56:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2019-10-01 22:56:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-01 22:56:52,361 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:56:52,362 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:56:52,362 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:56:52,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:56:52,362 INFO L82 PathProgramCache]: Analyzing trace with hash 545087476, now seen corresponding path program 9 times [2019-10-01 22:56:52,362 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:56:52,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:56:52,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:52,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:56:52,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:56:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:56:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:56:52,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:56:52,516 INFO L224 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-10-01 22:56:52,549 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-10-01 22:57:19,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-01 22:57:19,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:19,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:57:19,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:57:19,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:19,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:57:19,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:57:19,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:57:19,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:57:19,512 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 11 states. [2019-10-01 22:57:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:19,572 INFO L93 Difference]: Finished difference Result 302 states and 320 transitions. [2019-10-01 22:57:19,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:57:19,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 155 [2019-10-01 22:57:19,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:19,577 INFO L225 Difference]: With dead ends: 302 [2019-10-01 22:57:19,577 INFO L226 Difference]: Without dead ends: 163 [2019-10-01 22:57:19,578 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 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-10-01 22:57:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-01 22:57:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-10-01 22:57:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-01 22:57:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2019-10-01 22:57:19,586 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 155 [2019-10-01 22:57:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:19,587 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2019-10-01 22:57:19,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:57:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2019-10-01 22:57:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-01 22:57:19,589 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:19,589 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:19,589 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1849931630, now seen corresponding path program 10 times [2019-10-01 22:57:19,590 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:19,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:19,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:19,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:19,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:57:19,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:19,773 INFO L224 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-10-01 22:57:19,804 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:19,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:19,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:19,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:57:19,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2019-10-01 22:57:20,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:20,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-10-01 22:57:20,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:57:20,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:57:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:57:20,039 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 19 states. [2019-10-01 22:57:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:20,510 INFO L93 Difference]: Finished difference Result 328 states and 354 transitions. [2019-10-01 22:57:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:57:20,510 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 157 [2019-10-01 22:57:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:20,512 INFO L225 Difference]: With dead ends: 328 [2019-10-01 22:57:20,512 INFO L226 Difference]: Without dead ends: 189 [2019-10-01 22:57:20,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:57:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-01 22:57:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 180. [2019-10-01 22:57:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-01 22:57:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 189 transitions. [2019-10-01 22:57:20,522 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 189 transitions. Word has length 157 [2019-10-01 22:57:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:20,522 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 189 transitions. [2019-10-01 22:57:20,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:57:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 189 transitions. [2019-10-01 22:57:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-01 22:57:20,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:20,525 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:20,525 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:20,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:20,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1977144224, now seen corresponding path program 11 times [2019-10-01 22:57:20,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:20,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:20,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:20,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:20,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-10-01 22:57:20,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:20,705 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:20,736 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:44,060 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-10-01 22:58:44,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:44,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:58:44,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-10-01 22:58:44,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:44,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-10-01 22:58:44,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:58:44,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:58:44,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:58:44,335 INFO L87 Difference]: Start difference. First operand 180 states and 189 transitions. Second operand 21 states. [2019-10-01 22:58:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:44,805 INFO L93 Difference]: Finished difference Result 362 states and 388 transitions. [2019-10-01 22:58:44,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:58:44,807 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 175 [2019-10-01 22:58:44,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:44,808 INFO L225 Difference]: With dead ends: 362 [2019-10-01 22:58:44,809 INFO L226 Difference]: Without dead ends: 207 [2019-10-01 22:58:44,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:58:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-01 22:58:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 198. [2019-10-01 22:58:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-01 22:58:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 207 transitions. [2019-10-01 22:58:44,819 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 207 transitions. Word has length 175 [2019-10-01 22:58:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:44,819 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 207 transitions. [2019-10-01 22:58:44,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:58:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 207 transitions. [2019-10-01 22:58:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-01 22:58:44,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:44,822 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:44,822 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:44,823 INFO L82 PathProgramCache]: Analyzing trace with hash 575305518, now seen corresponding path program 12 times [2019-10-01 22:58:44,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:44,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:44,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:44,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-10-01 22:58:45,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:45,038 INFO L224 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-10-01 22:58:45,069 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:59:43,419 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 22:59:43,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:43,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:59:43,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 87 proven. 81 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2019-10-01 22:59:43,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:43,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2019-10-01 22:59:43,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:59:43,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:59:43,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:59:43,793 INFO L87 Difference]: Start difference. First operand 198 states and 207 transitions. Second operand 27 states. [2019-10-01 22:59:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:44,688 INFO L93 Difference]: Finished difference Result 405 states and 440 transitions. [2019-10-01 22:59:44,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:59:44,689 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 193 [2019-10-01 22:59:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:44,692 INFO L225 Difference]: With dead ends: 405 [2019-10-01 22:59:44,692 INFO L226 Difference]: Without dead ends: 234 [2019-10-01 22:59:44,693 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=375, Invalid=1107, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 22:59:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-01 22:59:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2019-10-01 22:59:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-10-01 22:59:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 243 transitions. [2019-10-01 22:59:44,703 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 243 transitions. Word has length 193 [2019-10-01 22:59:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:44,704 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 243 transitions. [2019-10-01 22:59:44,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:59:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-10-01 22:59:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-01 22:59:44,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:44,707 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:44,707 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:44,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:44,707 INFO L82 PathProgramCache]: Analyzing trace with hash -312440886, now seen corresponding path program 13 times [2019-10-01 22:59:44,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:44,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:44,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 22:59:44,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:44,996 INFO L224 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-10-01 22:59:45,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:59:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:45,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:59:45,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 22:59:45,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:45,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 22:59:45,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:59:45,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:59:45,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:59:45,194 INFO L87 Difference]: Start difference. First operand 234 states and 243 transitions. Second operand 16 states. [2019-10-01 22:59:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:45,250 INFO L93 Difference]: Finished difference Result 440 states and 458 transitions. [2019-10-01 22:59:45,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:59:45,250 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 229 [2019-10-01 22:59:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:45,252 INFO L225 Difference]: With dead ends: 440 [2019-10-01 22:59:45,252 INFO L226 Difference]: Without dead ends: 237 [2019-10-01 22:59:45,254 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:59:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-01 22:59:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2019-10-01 22:59:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-01 22:59:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 245 transitions. [2019-10-01 22:59:45,264 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 245 transitions. Word has length 229 [2019-10-01 22:59:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:45,265 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 245 transitions. [2019-10-01 22:59:45,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:59:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 245 transitions. [2019-10-01 22:59:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-01 22:59:45,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:45,268 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:45,269 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:45,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:45,269 INFO L82 PathProgramCache]: Analyzing trace with hash 895210216, now seen corresponding path program 14 times [2019-10-01 22:59:45,269 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:45,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:45,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:45,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:59:45,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 22:59:45,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:45,643 INFO L224 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-10-01 22:59:45,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:59:45,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:59:45,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:45,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:59:45,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 22:59:46,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:46,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:59:46,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:59:46,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:59:46,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:59:46,015 INFO L87 Difference]: Start difference. First operand 236 states and 245 transitions. Second operand 17 states. [2019-10-01 22:59:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:46,103 INFO L93 Difference]: Finished difference Result 442 states and 460 transitions. [2019-10-01 22:59:46,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:59:46,104 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 231 [2019-10-01 22:59:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:46,106 INFO L225 Difference]: With dead ends: 442 [2019-10-01 22:59:46,106 INFO L226 Difference]: Without dead ends: 239 [2019-10-01 22:59:46,109 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 231 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-10-01 22:59:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-10-01 22:59:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-10-01 22:59:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-01 22:59:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 247 transitions. [2019-10-01 22:59:46,119 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 247 transitions. Word has length 231 [2019-10-01 22:59:46,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:46,121 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 247 transitions. [2019-10-01 22:59:46,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:59:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 247 transitions. [2019-10-01 22:59:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-01 22:59:46,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:46,123 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:46,124 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:46,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:46,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1806749318, now seen corresponding path program 15 times [2019-10-01 22:59:46,124 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:46,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:46,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:46,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:46,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 22:59:46,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:46,432 INFO L224 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-10-01 22:59:46,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:01:00,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:01:00,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:00,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:01:00,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 27 proven. 121 refuted. 0 times theorem prover too weak. 1016 trivial. 0 not checked. [2019-10-01 23:01:01,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:01,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-10-01 23:01:01,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:01:01,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:01:01,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:01:01,155 INFO L87 Difference]: Start difference. First operand 238 states and 247 transitions. Second operand 31 states. [2019-10-01 23:01:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:02,029 INFO L93 Difference]: Finished difference Result 469 states and 496 transitions. [2019-10-01 23:01:02,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:01:02,030 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 233 [2019-10-01 23:01:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:02,031 INFO L225 Difference]: With dead ends: 469 [2019-10-01 23:01:02,031 INFO L226 Difference]: Without dead ends: 266 [2019-10-01 23:01:02,033 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=441, Invalid=1365, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 23:01:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-01 23:01:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2019-10-01 23:01:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-01 23:01:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 267 transitions. [2019-10-01 23:01:02,043 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 267 transitions. Word has length 233 [2019-10-01 23:01:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:02,044 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 267 transitions. [2019-10-01 23:01:02,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:01:02,044 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 267 transitions. [2019-10-01 23:01:02,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-01 23:01:02,046 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:02,046 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:02,046 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:02,047 INFO L82 PathProgramCache]: Analyzing trace with hash -942783182, now seen corresponding path program 16 times [2019-10-01 23:01:02,047 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:02,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:02,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:02,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:02,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2019-10-01 23:01:02,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:02,404 INFO L224 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-10-01 23:01:02,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:01:02,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:01:02,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:02,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:01:02,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:01:02,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:02,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:01:02,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:01:02,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:01:02,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:01:02,667 INFO L87 Difference]: Start difference. First operand 258 states and 267 transitions. Second operand 20 states. [2019-10-01 23:01:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:02,744 INFO L93 Difference]: Finished difference Result 480 states and 498 transitions. [2019-10-01 23:01:02,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:01:02,745 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 253 [2019-10-01 23:01:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:02,746 INFO L225 Difference]: With dead ends: 480 [2019-10-01 23:01:02,747 INFO L226 Difference]: Without dead ends: 261 [2019-10-01 23:01:02,748 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 253 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-10-01 23:01:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-10-01 23:01:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2019-10-01 23:01:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-01 23:01:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 269 transitions. [2019-10-01 23:01:02,758 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 269 transitions. Word has length 253 [2019-10-01 23:01:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:02,758 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 269 transitions. [2019-10-01 23:01:02,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:01:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 269 transitions. [2019-10-01 23:01:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-01 23:01:02,760 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:02,760 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:02,760 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:02,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash 855742032, now seen corresponding path program 17 times [2019-10-01 23:01:02,761 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:02,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:02,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1297 trivial. 0 not checked. [2019-10-01 23:01:03,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:03,440 INFO L224 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-10-01 23:01:03,494 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:03:17,129 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-10-01 23:03:17,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:03:17,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:03:17,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:03:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1297 trivial. 0 not checked. [2019-10-01 23:03:17,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:03:17,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 23:03:17,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:03:17,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:03:17,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:03:17,289 INFO L87 Difference]: Start difference. First operand 260 states and 269 transitions. Second operand 16 states. [2019-10-01 23:03:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:03:17,888 INFO L93 Difference]: Finished difference Result 477 states and 501 transitions. [2019-10-01 23:03:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 23:03:17,889 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 255 [2019-10-01 23:03:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:03:17,891 INFO L225 Difference]: With dead ends: 477 [2019-10-01 23:03:17,891 INFO L226 Difference]: Without dead ends: 284 [2019-10-01 23:03:17,892 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:03:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-10-01 23:03:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 276. [2019-10-01 23:03:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-10-01 23:03:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 285 transitions. [2019-10-01 23:03:17,903 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 285 transitions. Word has length 255 [2019-10-01 23:03:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:03:17,903 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 285 transitions. [2019-10-01 23:03:17,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:03:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 285 transitions. [2019-10-01 23:03:17,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-01 23:03:17,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:03:17,906 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:03:17,906 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:03:17,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:03:17,906 INFO L82 PathProgramCache]: Analyzing trace with hash 158558272, now seen corresponding path program 18 times [2019-10-01 23:03:17,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:03:17,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:03:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:17,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:03:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:03:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 1472 trivial. 0 not checked. [2019-10-01 23:03:18,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:03:18,507 INFO L224 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-10-01 23:03:18,546 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:05:05,198 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2019-10-01 23:05:05,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:05:05,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:05:05,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:05:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 58 proven. 169 refuted. 0 times theorem prover too weak. 1414 trivial. 0 not checked. [2019-10-01 23:05:05,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:05:05,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 21 [2019-10-01 23:05:05,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:05:05,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:05:05,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:05:05,410 INFO L87 Difference]: Start difference. First operand 276 states and 285 transitions. Second operand 21 states. [2019-10-01 23:05:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:05:06,326 INFO L93 Difference]: Finished difference Result 515 states and 547 transitions. [2019-10-01 23:05:06,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:05:06,327 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 271 [2019-10-01 23:05:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:05:06,330 INFO L225 Difference]: With dead ends: 515 [2019-10-01 23:05:06,330 INFO L226 Difference]: Without dead ends: 308 [2019-10-01 23:05:06,332 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=481, Invalid=851, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:05:06,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-01 23:05:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2019-10-01 23:05:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-10-01 23:05:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 317 transitions. [2019-10-01 23:05:06,342 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 317 transitions. Word has length 271 [2019-10-01 23:05:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:05:06,343 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 317 transitions. [2019-10-01 23:05:06,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:05:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 317 transitions. [2019-10-01 23:05:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-01 23:05:06,345 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:05:06,345 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:05:06,345 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:05:06,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:05:06,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1953649632, now seen corresponding path program 19 times [2019-10-01 23:05:06,346 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:05:06,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:05:06,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:06,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:05:06,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:05:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 1864 trivial. 0 not checked. [2019-10-01 23:05:07,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:05:07,143 INFO L224 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-10-01 23:05:07,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:05:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:05:07,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:05:07,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:05:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2019-10-01 23:05:07,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:05:07,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2019-10-01 23:05:07,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:05:07,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:05:07,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:05:07,785 INFO L87 Difference]: Start difference. First operand 308 states and 317 transitions. Second operand 36 states. [2019-10-01 23:05:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:05:08,616 INFO L93 Difference]: Finished difference Result 602 states and 628 transitions. [2019-10-01 23:05:08,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 23:05:08,619 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 303 [2019-10-01 23:05:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:05:08,620 INFO L225 Difference]: With dead ends: 602 [2019-10-01 23:05:08,620 INFO L226 Difference]: Without dead ends: 335 [2019-10-01 23:05:08,621 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:05:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-10-01 23:05:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 326. [2019-10-01 23:05:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-10-01 23:05:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 335 transitions. [2019-10-01 23:05:08,632 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 335 transitions. Word has length 303 [2019-10-01 23:05:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:05:08,632 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 335 transitions. [2019-10-01 23:05:08,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:05:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 335 transitions. [2019-10-01 23:05:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-10-01 23:05:08,634 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:05:08,634 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:05:08,635 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:05:08,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:05:08,635 INFO L82 PathProgramCache]: Analyzing trace with hash -109203538, now seen corresponding path program 20 times [2019-10-01 23:05:08,635 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:05:08,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:05:08,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:08,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:05:08,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:05:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2372 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 2116 trivial. 0 not checked. [2019-10-01 23:05:09,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:05:09,266 INFO L224 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-10-01 23:05:09,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:05:09,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:05:09,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:05:09,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 23:05:09,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:05:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2372 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:05:10,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:05:10,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2019-10-01 23:05:10,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 23:05:10,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 23:05:10,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:05:10,151 INFO L87 Difference]: Start difference. First operand 326 states and 335 transitions. Second operand 38 states. [2019-10-01 23:05:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:05:10,872 INFO L93 Difference]: Finished difference Result 636 states and 662 transitions. [2019-10-01 23:05:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 23:05:10,872 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 321 [2019-10-01 23:05:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:05:10,875 INFO L225 Difference]: With dead ends: 636 [2019-10-01 23:05:10,875 INFO L226 Difference]: Without dead ends: 353 [2019-10-01 23:05:10,877 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:05:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-10-01 23:05:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 344. [2019-10-01 23:05:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-10-01 23:05:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 353 transitions. [2019-10-01 23:05:10,888 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 353 transitions. Word has length 321 [2019-10-01 23:05:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:05:10,888 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 353 transitions. [2019-10-01 23:05:10,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 23:05:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 353 transitions. [2019-10-01 23:05:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-10-01 23:05:10,891 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:05:10,891 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:05:10,892 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:05:10,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:05:10,892 INFO L82 PathProgramCache]: Analyzing trace with hash 126200764, now seen corresponding path program 21 times [2019-10-01 23:05:10,892 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:05:10,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:05:10,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:10,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:05:10,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:05:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 2384 trivial. 0 not checked. [2019-10-01 23:05:11,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:05:11,796 INFO L224 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-10-01 23:05:11,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:07:36,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-01 23:07:36,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:36,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 23:07:36,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 2384 trivial. 0 not checked. [2019-10-01 23:07:36,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:36,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:07:36,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:07:36,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:07:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:07:36,314 INFO L87 Difference]: Start difference. First operand 344 states and 353 transitions. Second operand 21 states. [2019-10-01 23:07:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:36,937 INFO L93 Difference]: Finished difference Result 631 states and 655 transitions. [2019-10-01 23:07:36,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:07:36,938 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 339 [2019-10-01 23:07:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:36,941 INFO L225 Difference]: With dead ends: 631 [2019-10-01 23:07:36,941 INFO L226 Difference]: Without dead ends: 368 [2019-10-01 23:07:36,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:07:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-10-01 23:07:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 360. [2019-10-01 23:07:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-01 23:07:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 369 transitions. [2019-10-01 23:07:36,957 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 369 transitions. Word has length 339 [2019-10-01 23:07:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:36,957 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 369 transitions. [2019-10-01 23:07:36,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:07:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 369 transitions. [2019-10-01 23:07:36,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-10-01 23:07:36,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:36,961 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:36,961 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:36,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:36,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1108403628, now seen corresponding path program 22 times [2019-10-01 23:07:36,962 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:36,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:36,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:36,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:36,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2953 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 2629 trivial. 0 not checked. [2019-10-01 23:07:37,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:37,756 INFO L224 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-10-01 23:07:37,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:07:37,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:07:37,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:37,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 23:07:37,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2953 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 2629 trivial. 0 not checked. [2019-10-01 23:07:38,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:38,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 23:07:38,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 23:07:38,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 23:07:38,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:07:38,091 INFO L87 Difference]: Start difference. First operand 360 states and 369 transitions. Second operand 22 states. [2019-10-01 23:07:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:38,760 INFO L93 Difference]: Finished difference Result 661 states and 685 transitions. [2019-10-01 23:07:38,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:07:38,760 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 355 [2019-10-01 23:07:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:38,763 INFO L225 Difference]: With dead ends: 661 [2019-10-01 23:07:38,763 INFO L226 Difference]: Without dead ends: 384 [2019-10-01 23:07:38,764 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:07:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-10-01 23:07:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 376. [2019-10-01 23:07:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-10-01 23:07:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 385 transitions. [2019-10-01 23:07:38,775 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 385 transitions. Word has length 355 [2019-10-01 23:07:38,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:38,775 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 385 transitions. [2019-10-01 23:07:38,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 23:07:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 385 transitions. [2019-10-01 23:07:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-10-01 23:07:38,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:38,778 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:38,779 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:38,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1438056548, now seen corresponding path program 23 times [2019-10-01 23:07:38,779 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:38,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:38,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:38,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:38,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2019-10-01 23:07:39,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:39,235 INFO L224 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-10-01 23:07:39,276 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1