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-crafted/mapsum1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 21:46:36,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 21:46:36,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 21:46:36,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 21:46:36,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 21:46:36,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 21:46:36,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 21:46:36,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 21:46:36,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 21:46:36,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 21:46:36,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 21:46:36,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 21:46:36,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 21:46:36,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 21:46:36,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 21:46:36,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 21:46:36,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 21:46:36,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 21:46:36,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 21:46:36,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 21:46:36,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 21:46:36,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 21:46:36,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 21:46:36,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 21:46:36,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 21:46:36,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 21:46:36,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 21:46:36,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 21:46:36,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 21:46:36,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 21:46:36,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 21:46:36,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 21:46:36,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 21:46:36,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 21:46:36,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 21:46:36,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 21:46:36,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 21:46:36,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 21:46:36,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 21:46:36,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 21:46:36,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 21:46:36,438 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 21:46:36,453 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 21:46:36,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 21:46:36,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 21:46:36,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 21:46:36,455 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 21:46:36,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 21:46:36,456 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 21:46:36,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 21:46:36,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 21:46:36,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 21:46:36,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 21:46:36,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 21:46:36,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 21:46:36,457 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 21:46:36,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 21:46:36,457 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 21:46:36,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 21:46:36,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 21:46:36,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 21:46:36,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 21:46:36,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 21:46:36,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 21:46:36,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 21:46:36,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 21:46:36,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 21:46:36,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 21:46:36,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 21:46:36,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 21:46:36,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 21:46:36,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 21:46:36,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 21:46:36,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 21:46:36,506 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 21:46:36,506 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 21:46:36,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapsum1.i [2019-10-01 21:46:36,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2457c2ef/5de92027e3da45b997395bf48b818e49/FLAG13f273659 [2019-10-01 21:46:37,014 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 21:46:37,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum1.i [2019-10-01 21:46:37,027 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2457c2ef/5de92027e3da45b997395bf48b818e49/FLAG13f273659 [2019-10-01 21:46:37,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2457c2ef/5de92027e3da45b997395bf48b818e49 [2019-10-01 21:46:37,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 21:46:37,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 21:46:37,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 21:46:37,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 21:46:37,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 21:46:37,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 09:46:37" (1/1) ... [2019-10-01 21:46:37,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b090c3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:37, skipping insertion in model container [2019-10-01 21:46:37,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 09:46:37" (1/1) ... [2019-10-01 21:46:37,440 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 21:46:37,457 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 21:46:37,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 21:46:37,747 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 21:46:37,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 21:46:37,915 INFO L192 MainTranslator]: Completed translation [2019-10-01 21:46:37,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:37 WrapperNode [2019-10-01 21:46:37,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 21:46:37,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 21:46:37,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 21:46:37,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 21:46:37,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:37" (1/1) ... [2019-10-01 21:46:37,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:37" (1/1) ... [2019-10-01 21:46:37,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:37" (1/1) ... [2019-10-01 21:46:37,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:37" (1/1) ... [2019-10-01 21:46:37,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:37" (1/1) ... [2019-10-01 21:46:37,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:37" (1/1) ... [2019-10-01 21:46:37,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:37" (1/1) ... [2019-10-01 21:46:37,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 21:46:37,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 21:46:37,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 21:46:37,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 21:46:37,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:37" (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 21:46:38,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 21:46:38,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 21:46:38,053 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2019-10-01 21:46:38,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 21:46:38,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 21:46:38,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 21:46:38,053 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2019-10-01 21:46:38,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 21:46:38,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 21:46:38,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 21:46:38,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 21:46:38,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 21:46:38,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 21:46:38,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 21:46:38,400 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 21:46:38,401 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 21:46:38,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 09:46:38 BoogieIcfgContainer [2019-10-01 21:46:38,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 21:46:38,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 21:46:38,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 21:46:38,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 21:46:38,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 09:46:37" (1/3) ... [2019-10-01 21:46:38,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b712a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 09:46:38, skipping insertion in model container [2019-10-01 21:46:38,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:37" (2/3) ... [2019-10-01 21:46:38,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b712a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 09:46:38, skipping insertion in model container [2019-10-01 21:46:38,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 09:46:38" (3/3) ... [2019-10-01 21:46:38,411 INFO L109 eAbstractionObserver]: Analyzing ICFG mapsum1.i [2019-10-01 21:46:38,422 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 21:46:38,430 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 21:46:38,446 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 21:46:38,477 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 21:46:38,478 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 21:46:38,478 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 21:46:38,478 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 21:46:38,479 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 21:46:38,479 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 21:46:38,479 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 21:46:38,479 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 21:46:38,479 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 21:46:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 21:46:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 21:46:38,505 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,506 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:38,508 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2019-10-01 21:46:38,515 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:38,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 21:46:38,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:38,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 21:46:38,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 21:46:38,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 21:46:38,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 21:46:38,717 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 21:46:38,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:38,742 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-01 21:46:38,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 21:46:38,744 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-01 21:46:38,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:38,753 INFO L225 Difference]: With dead ends: 54 [2019-10-01 21:46:38,754 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 21:46:38,757 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 21:46:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 21:46:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 21:46:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 21:46:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-01 21:46:38,797 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-01 21:46:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:38,798 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-01 21:46:38,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 21:46:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-01 21:46:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 21:46:38,801 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,801 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:38,801 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,802 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2019-10-01 21:46:38,802 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:38,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 21:46:38,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:38,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 21:46:38,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 21:46:38,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 21:46:38,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:38,899 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-01 21:46:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:38,929 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 21:46:38,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:38,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-01 21:46:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:38,931 INFO L225 Difference]: With dead ends: 46 [2019-10-01 21:46:38,931 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 21:46:38,933 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 21:46:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 21:46:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 21:46:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 21:46:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-01 21:46:38,940 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-01 21:46:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:38,941 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-01 21:46:38,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 21:46:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-01 21:46:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 21:46:38,943 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,943 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:38,943 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2019-10-01 21:46:38,944 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:38,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 21:46:39,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:39,013 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 21:46:39,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-01 21:46:39,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 21:46:39,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 21:46:39,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-01 21:46:39,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 21:46:39,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 21:46:39,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 21:46:39,188 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-01 21:46:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:39,226 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 21:46:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:39,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-01 21:46:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:39,228 INFO L225 Difference]: With dead ends: 46 [2019-10-01 21:46:39,229 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 21:46:39,231 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 21:46:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 21:46:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 21:46:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 21:46:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 21:46:39,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-01 21:46:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:39,245 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 21:46:39,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 21:46:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 21:46:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 21:46:39,246 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:39,247 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 21:46:39,247 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:39,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2019-10-01 21:46:39,248 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:39,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:39,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:39,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:39,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:39,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 21:46:39,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 21:46:39,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 21:46:39,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:39,385 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 21:46:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:39,407 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-01 21:46:39,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:39,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-01 21:46:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:39,410 INFO L225 Difference]: With dead ends: 43 [2019-10-01 21:46:39,410 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 21:46:39,410 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 21:46:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 21:46:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 21:46:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 21:46:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 21:46:39,417 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-01 21:46:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:39,420 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 21:46:39,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 21:46:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 21:46:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 21:46:39,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:39,422 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 21:46:39,422 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:39,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:39,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2019-10-01 21:46:39,423 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:39,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:39,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:39,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:39,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:39,549 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 21:46:39,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:39,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-01 21:46:39,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:39,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 21:46:39,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 21:46:39,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 21:46:39,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 21:46:39,687 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-01 21:46:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:39,739 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-01 21:46:39,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 21:46:39,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-01 21:46:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:39,741 INFO L225 Difference]: With dead ends: 52 [2019-10-01 21:46:39,741 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 21:46:39,743 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 21:46:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 21:46:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-01 21:46:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 21:46:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-01 21:46:39,769 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-01 21:46:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:39,770 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-01 21:46:39,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 21:46:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-01 21:46:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 21:46:39,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:39,776 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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 21:46:39,776 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:39,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2019-10-01 21:46:39,777 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:39,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:39,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:39,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:39,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:39,902 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:39,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:39,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:39,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:39,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:39,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:40,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:40,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 21:46:40,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 21:46:40,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 21:46:40,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 21:46:40,017 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-01 21:46:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:40,051 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-01 21:46:40,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 21:46:40,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-01 21:46:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:40,052 INFO L225 Difference]: With dead ends: 54 [2019-10-01 21:46:40,052 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 21:46:40,053 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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 21:46:40,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 21:46:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-01 21:46:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 21:46:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-01 21:46:40,059 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-01 21:46:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:40,059 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-01 21:46:40,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 21:46:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-01 21:46:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 21:46:40,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:40,061 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 21:46:40,061 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:40,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:40,062 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2019-10-01 21:46:40,062 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:40,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:40,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:40,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:40,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:40,130 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 21:46:40,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:40,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 21:46:40,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:40,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:40,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 21:46:40,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:40,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 21:46:40,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 21:46:40,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 21:46:40,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:40,222 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-01 21:46:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:40,271 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-01 21:46:40,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 21:46:40,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 21:46:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:40,275 INFO L225 Difference]: With dead ends: 59 [2019-10-01 21:46:40,275 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 21:46:40,276 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 21:46:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 21:46:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 21:46:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-01 21:46:40,281 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-01 21:46:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:40,282 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-01 21:46:40,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 21:46:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-01 21:46:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 21:46:40,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:40,284 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 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] [2019-10-01 21:46:40,284 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:40,284 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2019-10-01 21:46:40,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:40,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:40,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:40,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 21:46:40,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:40,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 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 21:46:40,392 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:40,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:40,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:40,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:40,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:40,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:40,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 21:46:40,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 21:46:40,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 21:46:40,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:40,508 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-01 21:46:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:40,571 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 21:46:40,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 21:46:40,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-01 21:46:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:40,575 INFO L225 Difference]: With dead ends: 62 [2019-10-01 21:46:40,575 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 21:46:40,577 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 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 21:46:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 21:46:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 21:46:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 21:46:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-01 21:46:40,587 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-01 21:46:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:40,588 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-01 21:46:40,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 21:46:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-01 21:46:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 21:46:40,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:40,591 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2019-10-01 21:46:40,591 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2019-10-01 21:46:40,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:40,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:40,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:40,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 21:46:40,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:40,740 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) [2019-10-01 21:46:40,767 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:40,834 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 21:46:40,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:40,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:40,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 21:46:40,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:40,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 21:46:40,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:40,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:40,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:40,894 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-01 21:46:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:40,952 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-01 21:46:40,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:40,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-01 21:46:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:40,953 INFO L225 Difference]: With dead ends: 67 [2019-10-01 21:46:40,954 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 21:46:40,954 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 21:46:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-01 21:46:40,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 21:46:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-01 21:46:40,960 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-01 21:46:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:40,960 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-01 21:46:40,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-01 21:46:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 21:46:40,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:40,962 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 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] [2019-10-01 21:46:40,962 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:40,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:40,963 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2019-10-01 21:46:40,963 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:40,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:40,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:40,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-01 21:46:41,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:41,082 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 21:46:41,113 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:41,155 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 21:46:41,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:41,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:41,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-01 21:46:41,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:41,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-01 21:46:41,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:41,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:41,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:41,204 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-01 21:46:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:41,274 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-01 21:46:41,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:41,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-01 21:46:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:41,275 INFO L225 Difference]: With dead ends: 73 [2019-10-01 21:46:41,275 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 21:46:41,276 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 21:46:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 21:46:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 21:46:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-01 21:46:41,282 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-01 21:46:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:41,282 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-01 21:46:41,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-01 21:46:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 21:46:41,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:41,284 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:41,284 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:41,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:41,285 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2019-10-01 21:46:41,285 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:41,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:41,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:41,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:41,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:41,397 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 21:46:41,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:41,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:41,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:41,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 21:46:41,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:41,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:41,521 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-01 21:46:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:41,571 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-01 21:46:41,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 21:46:41,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-01 21:46:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:41,572 INFO L225 Difference]: With dead ends: 76 [2019-10-01 21:46:41,572 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 21:46:41,573 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 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 21:46:41,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 21:46:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-01 21:46:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 21:46:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-01 21:46:41,582 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-01 21:46:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:41,583 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-01 21:46:41,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-01 21:46:41,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 21:46:41,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:41,584 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:41,585 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2019-10-01 21:46:41,585 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:41,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:41,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:41,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:41,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:41,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:41,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:41,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:41,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:41,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:41,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:41,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:41,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 21:46:41,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 21:46:41,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 21:46:41,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 21:46:41,825 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-01 21:46:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:41,892 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-01 21:46:41,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:41,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-01 21:46:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:41,895 INFO L225 Difference]: With dead ends: 78 [2019-10-01 21:46:41,895 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 21:46:41,896 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 21:46:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 21:46:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-01 21:46:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 21:46:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-01 21:46:41,906 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-01 21:46:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:41,909 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-01 21:46:41,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 21:46:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-01 21:46:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 21:46:41,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:41,911 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:41,911 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:41,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2019-10-01 21:46:41,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:41,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:41,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:41,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:42,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:42,045 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 21:46:42,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:42,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 21:46:42,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:42,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:42,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 21:46:42,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:42,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-01 21:46:42,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 21:46:42,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 21:46:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 21:46:42,166 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-01 21:46:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:42,236 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-01 21:46:42,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 21:46:42,236 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 21:46:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:42,237 INFO L225 Difference]: With dead ends: 83 [2019-10-01 21:46:42,238 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 21:46:42,238 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 21:46:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 21:46:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-01 21:46:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 21:46:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-01 21:46:42,250 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-01 21:46:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:42,251 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-01 21:46:42,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 21:46:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-01 21:46:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 21:46:42,252 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:42,252 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 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] [2019-10-01 21:46:42,253 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:42,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:42,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2019-10-01 21:46:42,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:42,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:42,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:42,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 21:46:42,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:42,403 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:42,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:42,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:42,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:42,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 21:46:42,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-01 21:46:42,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:42,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-01 21:46:42,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 21:46:42,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 21:46:42,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:42,555 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-01 21:46:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:42,639 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-01 21:46:42,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 21:46:42,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-01 21:46:42,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:42,641 INFO L225 Difference]: With dead ends: 89 [2019-10-01 21:46:42,641 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 21:46:42,642 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 21:46:42,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-01 21:46:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 21:46:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-01 21:46:42,648 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-01 21:46:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:42,649 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-01 21:46:42,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 21:46:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-01 21:46:42,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 21:46:42,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:42,652 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 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] [2019-10-01 21:46:42,652 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2019-10-01 21:46:42,653 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:42,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:42,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 21:46:42,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:42,808 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 21:46:42,835 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:43,100 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 21:46:43,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:43,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:43,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Stream closed [2019-10-01 21:46:43,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:43,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 21:46:43,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 21:46:43,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 21:46:43,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:43,184 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-01 21:46:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:43,263 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-01 21:46:43,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:43,264 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-01 21:46:43,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:43,265 INFO L225 Difference]: With dead ends: 95 [2019-10-01 21:46:43,265 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 21:46:43,267 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 21:46:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-01 21:46:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 21:46:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-01 21:46:43,278 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-01 21:46:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:43,278 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-01 21:46:43,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 21:46:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-01 21:46:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 21:46:43,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:43,280 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 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] [2019-10-01 21:46:43,280 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2019-10-01 21:46:43,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:43,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:43,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:43,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-01 21:46:43,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:43,478 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 21:46:43,522 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:43,703 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 21:46:43,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:43,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 21:46:43,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-10-01 21:46:43,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:43,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-01 21:46:43,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 21:46:43,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 21:46:43,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:43,783 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-01 21:46:43,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:43,879 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-01 21:46:43,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:43,880 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 21:46:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:43,881 INFO L225 Difference]: With dead ends: 101 [2019-10-01 21:46:43,881 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 21:46:43,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 21:46:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 21:46:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 21:46:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-01 21:46:43,895 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-01 21:46:43,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:43,896 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-01 21:46:43,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 21:46:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-01 21:46:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 21:46:43,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:43,897 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:43,897 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:43,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:43,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2019-10-01 21:46:43,898 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:43,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:43,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:43,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:44,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:44,096 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 21:46:44,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:44,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:46:44,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:44,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:44,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 21:46:44,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 21:46:44,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 21:46:44,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:44,251 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-01 21:46:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:44,310 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-01 21:46:44,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 21:46:44,311 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-01 21:46:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:44,312 INFO L225 Difference]: With dead ends: 104 [2019-10-01 21:46:44,312 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 21:46:44,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 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 21:46:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 21:46:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-01 21:46:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 21:46:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-01 21:46:44,318 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-01 21:46:44,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:44,318 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-01 21:46:44,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 21:46:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-01 21:46:44,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 21:46:44,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:44,320 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:44,320 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:44,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:44,320 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2019-10-01 21:46:44,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:44,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:44,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:44,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:44,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:44,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:44,524 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) [2019-10-01 21:46:44,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:44,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:44,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:44,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:46:44,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:44,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:44,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 21:46:44,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 21:46:44,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 21:46:44,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 21:46:44,645 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-01 21:46:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:44,706 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-01 21:46:44,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 21:46:44,707 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-01 21:46:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:44,708 INFO L225 Difference]: With dead ends: 106 [2019-10-01 21:46:44,708 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 21:46:44,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 21:46:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 21:46:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 21:46:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 21:46:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-01 21:46:44,714 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-01 21:46:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:44,714 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-01 21:46:44,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 21:46:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-01 21:46:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 21:46:44,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:44,716 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:44,716 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2019-10-01 21:46:44,716 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:44,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:44,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:44,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:44,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:44,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:44,917 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 21:46:44,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:45,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 21:46:45,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:45,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 21:46:45,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-10-01 21:46:45,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:45,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-01 21:46:45,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 21:46:45,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 21:46:45,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:45,126 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-01 21:46:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:45,230 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-01 21:46:45,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 21:46:45,230 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-01 21:46:45,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:45,231 INFO L225 Difference]: With dead ends: 111 [2019-10-01 21:46:45,232 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 21:46:45,232 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:45,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 21:46:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-01 21:46:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 21:46:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-01 21:46:45,242 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-01 21:46:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:45,243 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-01 21:46:45,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 21:46:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-01 21:46:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 21:46:45,244 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:45,244 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:45,253 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:45,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:45,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2019-10-01 21:46:45,254 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:45,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:45,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:45,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:45,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:45,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:45,491 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 21:46:45,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:45,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:45,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:45,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:46:45,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:45,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:45,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 21:46:45,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 21:46:45,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 21:46:45,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 21:46:45,628 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-01 21:46:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:45,689 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-01 21:46:45,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:45,691 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-01 21:46:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:45,692 INFO L225 Difference]: With dead ends: 114 [2019-10-01 21:46:45,692 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 21:46:45,693 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 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 21:46:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 21:46:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 21:46:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 21:46:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-01 21:46:45,699 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-01 21:46:45,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:45,700 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-01 21:46:45,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 21:46:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-01 21:46:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 21:46:45,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:45,701 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:45,701 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:45,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2019-10-01 21:46:45,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:45,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:45,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:45,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:45,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:45,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:45,965 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 21:46:45,987 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:46,407 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 21:46:46,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:46,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 21:46:46,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-10-01 21:46:46,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:46,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-01 21:46:46,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 21:46:46,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 21:46:46,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:46,566 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-01 21:46:46,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:46,673 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-01 21:46:46,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 21:46:46,674 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-01 21:46:46,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:46,675 INFO L225 Difference]: With dead ends: 119 [2019-10-01 21:46:46,675 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 21:46:46,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:46,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 21:46:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-01 21:46:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 21:46:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-01 21:46:46,683 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-01 21:46:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:46,683 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-01 21:46:46,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 21:46:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-01 21:46:46,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 21:46:46,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:46,686 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:46,687 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:46,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:46,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2019-10-01 21:46:46,687 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:46,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:46,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:46,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:46,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-10-01 21:46:46,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:46,973 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 21:46:46,998 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:47,213 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 21:46:47,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:47,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:47,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 234 proven. 16 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-10-01 21:46:47,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:47,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2019-10-01 21:46:47,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 21:46:47,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 21:46:47,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:47,316 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2019-10-01 21:46:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:47,431 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-10-01 21:46:47,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 21:46:47,434 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2019-10-01 21:46:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:47,435 INFO L225 Difference]: With dead ends: 125 [2019-10-01 21:46:47,435 INFO L226 Difference]: Without dead ends: 87 [2019-10-01 21:46:47,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-01 21:46:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-01 21:46:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 21:46:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-01 21:46:47,442 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2019-10-01 21:46:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:47,444 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-01 21:46:47,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 21:46:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-01 21:46:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 21:46:47,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:47,446 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 19, 19, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:47,446 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:47,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:47,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1116806727, now seen corresponding path program 19 times [2019-10-01 21:46:47,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:47,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:47,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:47,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:47,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:47,727 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 21:46:47,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:47,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 21:46:47,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:47,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:47,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 21:46:47,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 21:46:47,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 21:46:47,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 21:46:47,856 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2019-10-01 21:46:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:47,931 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-10-01 21:46:47,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 21:46:47,933 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2019-10-01 21:46:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:47,934 INFO L225 Difference]: With dead ends: 128 [2019-10-01 21:46:47,934 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 21:46:47,935 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 21:46:47,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 21:46:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-01 21:46:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 21:46:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-01 21:46:47,939 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2019-10-01 21:46:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:47,939 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-01 21:46:47,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 21:46:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-01 21:46:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 21:46:47,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:47,940 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:47,941 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:47,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 20 times [2019-10-01 21:46:47,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:47,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:47,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:47,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:48,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:48,262 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 21:46:48,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:48,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:48,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:48,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 21:46:48,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:48,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:48,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 21:46:48,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 21:46:48,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 21:46:48,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:48,412 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-01 21:46:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:48,484 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-01 21:46:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 21:46:48,485 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-01 21:46:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:48,485 INFO L225 Difference]: With dead ends: 130 [2019-10-01 21:46:48,486 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 21:46:48,486 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 21:46:48,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-01 21:46:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 21:46:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-01 21:46:48,490 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-01 21:46:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:48,491 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-01 21:46:48,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 21:46:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-01 21:46:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 21:46:48,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:48,492 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:48,492 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:48,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:48,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 21 times [2019-10-01 21:46:48,493 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:48,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:48,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:48,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:48,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:48,800 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 21:46:48,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:48,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 21:46:48,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:48,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 21:46:48,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2019-10-01 21:46:48,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:48,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2019-10-01 21:46:48,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 21:46:48,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 21:46:48,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:48,996 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2019-10-01 21:46:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:49,143 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-10-01 21:46:49,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 21:46:49,144 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2019-10-01 21:46:49,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:49,145 INFO L225 Difference]: With dead ends: 135 [2019-10-01 21:46:49,145 INFO L226 Difference]: Without dead ends: 95 [2019-10-01 21:46:49,146 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-01 21:46:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-10-01 21:46:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 21:46:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-01 21:46:49,151 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2019-10-01 21:46:49,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:49,151 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-01 21:46:49,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 21:46:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-01 21:46:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-01 21:46:49,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:49,153 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:49,153 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:49,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:49,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2078845859, now seen corresponding path program 22 times [2019-10-01 21:46:49,154 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:49,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:49,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:49,515 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 21:46:49,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:49,605 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:49,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:49,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 21:46:49,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:49,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:49,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 21:46:49,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 21:46:49,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 21:46:49,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:49,642 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2019-10-01 21:46:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:49,731 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-10-01 21:46:49,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 21:46:49,732 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2019-10-01 21:46:49,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:49,733 INFO L225 Difference]: With dead ends: 138 [2019-10-01 21:46:49,733 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 21:46:49,734 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 21:46:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-01 21:46:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 21:46:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-01 21:46:49,739 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2019-10-01 21:46:49,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:49,739 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-01 21:46:49,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 21:46:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-01 21:46:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 21:46:49,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:49,741 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:49,741 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:49,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:49,741 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 23 times [2019-10-01 21:46:49,741 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:49,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:49,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:49,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:50,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:50,074 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:50,107 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:52,599 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 21:46:52,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:52,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:52,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-01 21:46:52,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:52,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2019-10-01 21:46:52,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 21:46:52,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 21:46:52,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:52,811 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2019-10-01 21:46:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:52,981 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-10-01 21:46:52,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 21:46:52,981 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2019-10-01 21:46:52,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:52,983 INFO L225 Difference]: With dead ends: 143 [2019-10-01 21:46:52,983 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 21:46:52,984 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 21:46:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-01 21:46:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 21:46:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-10-01 21:46:52,992 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2019-10-01 21:46:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:52,992 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-10-01 21:46:52,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 21:46:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-10-01 21:46:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-01 21:46:52,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:52,997 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:52,998 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1976094561, now seen corresponding path program 24 times [2019-10-01 21:46:53,000 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:53,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:53,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:53,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:53,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 21:46:53,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:53,604 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:53,645 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:54,640 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 21:46:54,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:54,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 21:46:54,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2019-10-01 21:46:54,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:54,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2019-10-01 21:46:54,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 21:46:54,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 21:46:54,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:54,767 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2019-10-01 21:46:54,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:54,869 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-10-01 21:46:54,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 21:46:54,869 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2019-10-01 21:46:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:54,870 INFO L225 Difference]: With dead ends: 149 [2019-10-01 21:46:54,870 INFO L226 Difference]: Without dead ends: 105 [2019-10-01 21:46:54,871 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:54,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-01 21:46:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-01 21:46:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-01 21:46:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-10-01 21:46:54,876 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2019-10-01 21:46:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:54,876 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-10-01 21:46:54,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 21:46:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-10-01 21:46:54,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-01 21:46:54,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:54,877 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:54,878 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:54,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:54,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1521279999, now seen corresponding path program 25 times [2019-10-01 21:46:54,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:54,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:54,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:54,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:54,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:55,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:55,256 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:55,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:55,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 21:46:55,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:55,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:55,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 21:46:55,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 21:46:55,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 21:46:55,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 21:46:55,415 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2019-10-01 21:46:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:55,518 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-10-01 21:46:55,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 21:46:55,518 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2019-10-01 21:46:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:55,519 INFO L225 Difference]: With dead ends: 152 [2019-10-01 21:46:55,519 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 21:46:55,520 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 21:46:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 21:46:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-01 21:46:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 21:46:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-01 21:46:55,525 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2019-10-01 21:46:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:55,525 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-01 21:46:55,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 21:46:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-01 21:46:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 21:46:55,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:55,526 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:55,527 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:55,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:55,527 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 26 times [2019-10-01 21:46:55,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:55,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:55,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:56,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:56,075 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:56,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:56,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:56,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:56,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 21:46:56,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:56,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:56,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 21:46:56,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 21:46:56,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 21:46:56,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:56,241 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-01 21:46:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:56,370 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-01 21:46:56,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 21:46:56,371 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-01 21:46:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:56,372 INFO L225 Difference]: With dead ends: 154 [2019-10-01 21:46:56,372 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 21:46:56,374 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:56,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 21:46:56,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-01 21:46:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 21:46:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-01 21:46:56,380 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-01 21:46:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:56,380 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-01 21:46:56,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 21:46:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-01 21:46:56,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-01 21:46:56,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:56,382 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:56,382 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:56,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:56,382 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 27 times [2019-10-01 21:46:56,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:56,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:56,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:56,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:56,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:57,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:57,136 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:57,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:57,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 21:46:57,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:57,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:57,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2019-10-01 21:46:57,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:57,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2019-10-01 21:46:57,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 21:46:57,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 21:46:57,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 21:46:57,515 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2019-10-01 21:46:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:57,696 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2019-10-01 21:46:57,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 21:46:57,706 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2019-10-01 21:46:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:57,707 INFO L225 Difference]: With dead ends: 159 [2019-10-01 21:46:57,707 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 21:46:57,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 21:46:57,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 21:46:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-10-01 21:46:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 21:46:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-10-01 21:46:57,712 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2019-10-01 21:46:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:57,712 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-10-01 21:46:57,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 21:46:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-10-01 21:46:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 21:46:57,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:57,714 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:57,714 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:57,715 INFO L82 PathProgramCache]: Analyzing trace with hash 894020771, now seen corresponding path program 28 times [2019-10-01 21:46:57,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:57,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:57,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:57,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:57,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 21:46:58,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:58,557 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:58,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:58,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:58,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:58,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:58,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-10-01 21:46:58,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:58,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2019-10-01 21:46:58,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 21:46:58,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 21:46:58,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 21:46:58,957 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2019-10-01 21:46:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:59,141 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2019-10-01 21:46:59,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 21:46:59,142 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2019-10-01 21:46:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:59,144 INFO L225 Difference]: With dead ends: 165 [2019-10-01 21:46:59,144 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 21:46:59,145 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 21:46:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 21:46:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-10-01 21:46:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 21:46:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-10-01 21:46:59,160 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2019-10-01 21:46:59,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:59,160 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-10-01 21:46:59,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 21:46:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-10-01 21:46:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-01 21:46:59,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:59,162 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 27, 27, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:59,162 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:59,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:59,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1573539069, now seen corresponding path program 29 times [2019-10-01 21:46:59,163 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:59,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:59,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:59,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-10-01 21:46:59,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:59,781 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:59,848 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:47:28,407 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 21:47:28,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:28,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 21:47:28,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-10-01 21:47:28,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:28,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2019-10-01 21:47:28,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:47:28,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:47:28,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:28,723 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2019-10-01 21:47:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:28,923 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2019-10-01 21:47:28,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 21:47:28,924 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2019-10-01 21:47:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:28,925 INFO L225 Difference]: With dead ends: 171 [2019-10-01 21:47:28,925 INFO L226 Difference]: Without dead ends: 121 [2019-10-01 21:47:28,927 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-01 21:47:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-10-01 21:47:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 21:47:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-10-01 21:47:28,932 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2019-10-01 21:47:28,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:28,933 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-10-01 21:47:28,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:47:28,933 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-10-01 21:47:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-01 21:47:28,934 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:28,934 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:28,934 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:28,935 INFO L82 PathProgramCache]: Analyzing trace with hash -451694749, now seen corresponding path program 30 times [2019-10-01 21:47:28,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:28,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:28,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:28,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:28,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-10-01 21:47:29,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:29,477 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:29,516 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:47:31,405 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 21:47:31,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:31,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 21:47:31,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2019-10-01 21:47:31,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:31,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2019-10-01 21:47:31,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:47:31,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:47:31,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:31,639 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2019-10-01 21:47:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:31,848 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2019-10-01 21:47:31,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 21:47:31,849 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2019-10-01 21:47:31,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:31,850 INFO L225 Difference]: With dead ends: 177 [2019-10-01 21:47:31,850 INFO L226 Difference]: Without dead ends: 125 [2019-10-01 21:47:31,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-01 21:47:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-10-01 21:47:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-01 21:47:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-10-01 21:47:31,857 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2019-10-01 21:47:31,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:31,858 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-10-01 21:47:31,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:47:31,858 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-10-01 21:47:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-01 21:47:31,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:31,859 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:31,859 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:31,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:31,860 INFO L82 PathProgramCache]: Analyzing trace with hash 853170883, now seen corresponding path program 31 times [2019-10-01 21:47:31,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:31,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:31,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:31,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:31,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:32,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:32,444 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:32,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:32,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 21:47:32,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:32,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:32,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 21:47:32,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 21:47:32,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 21:47:32,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:47:32,644 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2019-10-01 21:47:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:32,800 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2019-10-01 21:47:32,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 21:47:32,801 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2019-10-01 21:47:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:32,803 INFO L225 Difference]: With dead ends: 180 [2019-10-01 21:47:32,803 INFO L226 Difference]: Without dead ends: 126 [2019-10-01 21:47:32,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 21:47:32,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-01 21:47:32,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-01 21:47:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 21:47:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-01 21:47:32,810 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2019-10-01 21:47:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:32,810 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-01 21:47:32,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 21:47:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-01 21:47:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 21:47:32,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:32,811 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:32,812 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:32,812 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 32 times [2019-10-01 21:47:32,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:32,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:32,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:32,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:32,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:33,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:33,364 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:33,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:47:33,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:47:33,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:33,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 21:47:33,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:33,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:33,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 21:47:33,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 21:47:33,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 21:47:33,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:47:33,553 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-01 21:47:33,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:33,679 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-01 21:47:33,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 21:47:33,681 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-01 21:47:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:33,682 INFO L225 Difference]: With dead ends: 182 [2019-10-01 21:47:33,682 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 21:47:33,683 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:47:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 21:47:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-01 21:47:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 21:47:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-01 21:47:33,688 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-01 21:47:33,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:33,688 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-01 21:47:33,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 21:47:33,689 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-01 21:47:33,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 21:47:33,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:33,690 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:33,690 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:33,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:33,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 33 times [2019-10-01 21:47:33,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:33,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:33,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:33,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:33,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:34,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:34,520 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:34,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:47:34,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 21:47:34,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:34,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 21:47:34,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 450 proven. 81 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2019-10-01 21:47:34,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:34,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2019-10-01 21:47:34,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 21:47:34,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 21:47:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 21:47:34,968 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2019-10-01 21:47:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:35,166 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2019-10-01 21:47:35,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 21:47:35,167 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2019-10-01 21:47:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:35,168 INFO L225 Difference]: With dead ends: 187 [2019-10-01 21:47:35,169 INFO L226 Difference]: Without dead ends: 133 [2019-10-01 21:47:35,170 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 21:47:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-01 21:47:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-10-01 21:47:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-01 21:47:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-10-01 21:47:35,175 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2019-10-01 21:47:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:35,176 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-10-01 21:47:35,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 21:47:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-10-01 21:47:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-01 21:47:35,177 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:35,177 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:35,177 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:35,178 INFO L82 PathProgramCache]: Analyzing trace with hash 854412647, now seen corresponding path program 34 times [2019-10-01 21:47:35,178 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:35,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:35,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:35,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:35,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2019-10-01 21:47:35,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:35,944 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:35,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:47:36,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:47:36,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:36,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:47:36,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 450 proven. 100 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-10-01 21:47:36,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:36,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-01 21:47:36,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 21:47:36,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 21:47:36,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:47:36,357 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2019-10-01 21:47:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:36,603 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2019-10-01 21:47:36,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 21:47:36,604 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2019-10-01 21:47:36,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:36,605 INFO L225 Difference]: With dead ends: 193 [2019-10-01 21:47:36,605 INFO L226 Difference]: Without dead ends: 137 [2019-10-01 21:47:36,606 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:47:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-01 21:47:36,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-10-01 21:47:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-01 21:47:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-10-01 21:47:36,611 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2019-10-01 21:47:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:36,611 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-10-01 21:47:36,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 21:47:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-10-01 21:47:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-01 21:47:36,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:36,613 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:36,613 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:36,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:36,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1113930553, now seen corresponding path program 35 times [2019-10-01 21:47:36,614 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:36,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:36,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:36,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:36,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2019-10-01 21:47:37,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:37,249 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:37,298 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:48:35,671 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-01 21:48:35,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:35,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:48:35,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 444 proven. 100 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2019-10-01 21:48:35,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:35,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2019-10-01 21:48:35,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 21:48:35,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 21:48:35,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:48:35,997 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2019-10-01 21:48:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:36,196 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2019-10-01 21:48:36,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 21:48:36,196 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2019-10-01 21:48:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:36,197 INFO L225 Difference]: With dead ends: 199 [2019-10-01 21:48:36,197 INFO L226 Difference]: Without dead ends: 141 [2019-10-01 21:48:36,198 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:48:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-01 21:48:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-10-01 21:48:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 21:48:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2019-10-01 21:48:36,202 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2019-10-01 21:48:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:36,203 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2019-10-01 21:48:36,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 21:48:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2019-10-01 21:48:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-01 21:48:36,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:36,204 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:36,205 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:36,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2006594855, now seen corresponding path program 36 times [2019-10-01 21:48:36,205 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:36,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:36,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:36,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:36,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2019-10-01 21:48:37,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:37,152 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:37,228 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:48:46,581 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 21:48:46,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:46,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 21:48:46,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2019-10-01 21:48:46,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:46,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2019-10-01 21:48:46,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 21:48:46,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 21:48:46,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:48:46,864 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2019-10-01 21:48:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:47,136 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2019-10-01 21:48:47,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 21:48:47,136 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2019-10-01 21:48:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:47,138 INFO L225 Difference]: With dead ends: 205 [2019-10-01 21:48:47,138 INFO L226 Difference]: Without dead ends: 145 [2019-10-01 21:48:47,140 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:48:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-01 21:48:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-10-01 21:48:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-01 21:48:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2019-10-01 21:48:47,148 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2019-10-01 21:48:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:47,148 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2019-10-01 21:48:47,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 21:48:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2019-10-01 21:48:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-01 21:48:47,151 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:47,151 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:47,152 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2105744263, now seen corresponding path program 37 times [2019-10-01 21:48:47,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:47,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:47,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:47,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:47,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:48,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:48,077 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:48,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:48:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:48,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 21:48:48,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:48,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:48,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 21:48:48,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 21:48:48,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 21:48:48,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 21:48:48,274 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2019-10-01 21:48:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:48,404 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2019-10-01 21:48:48,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 21:48:48,405 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2019-10-01 21:48:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:48,406 INFO L225 Difference]: With dead ends: 208 [2019-10-01 21:48:48,406 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 21:48:48,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 21:48:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 21:48:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-10-01 21:48:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 21:48:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-01 21:48:48,412 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2019-10-01 21:48:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:48,413 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-01 21:48:48,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 21:48:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-01 21:48:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 21:48:48,414 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:48,414 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:48,415 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:48,415 INFO L82 PathProgramCache]: Analyzing trace with hash -283013655, now seen corresponding path program 38 times [2019-10-01 21:48:48,415 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:48,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:48,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:48,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:48:48,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:49,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:49,093 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:49,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:48:49,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:48:49,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:49,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 21:48:49,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:49,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:49,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 21:48:49,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:48:49,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:48:49,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:48:49,353 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-01 21:48:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:49,516 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-01 21:48:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 21:48:49,517 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2019-10-01 21:48:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:49,518 INFO L225 Difference]: With dead ends: 210 [2019-10-01 21:48:49,518 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 21:48:49,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:48:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 21:48:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 21:48:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 21:48:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-01 21:48:49,524 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2019-10-01 21:48:49,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:49,524 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-01 21:48:49,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:48:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-01 21:48:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-01 21:48:49,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:49,526 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:49,526 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1928130507, now seen corresponding path program 39 times [2019-10-01 21:48:49,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:49,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:49,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:49,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:49,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 21:48:50,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:50,282 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:50,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:48:50,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 21:48:50,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:50,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 21:48:50,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 632 proven. 144 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2019-10-01 21:48:51,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:51,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2019-10-01 21:48:51,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 21:48:51,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 21:48:51,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:48:51,044 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2019-10-01 21:48:51,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:51,263 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2019-10-01 21:48:51,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 21:48:51,265 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2019-10-01 21:48:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:51,267 INFO L225 Difference]: With dead ends: 215 [2019-10-01 21:48:51,267 INFO L226 Difference]: Without dead ends: 153 [2019-10-01 21:48:51,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:48:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-01 21:48:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-10-01 21:48:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-01 21:48:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2019-10-01 21:48:51,274 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2019-10-01 21:48:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:51,275 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2019-10-01 21:48:51,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 21:48:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2019-10-01 21:48:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-01 21:48:51,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:51,276 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:51,276 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:51,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:51,277 INFO L82 PathProgramCache]: Analyzing trace with hash -15611861, now seen corresponding path program 40 times [2019-10-01 21:48:51,277 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:51,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:51,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:51,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:51,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:48:52,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:52,037 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:52,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:48:52,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:48:52,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:48:52,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 21:48:52,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:48:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:48:52,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:48:52,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 21:48:52,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 21:48:52,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 21:48:52,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 21:48:52,255 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 44 states. [2019-10-01 21:48:52,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:48:52,407 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2019-10-01 21:48:52,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 21:48:52,408 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2019-10-01 21:48:52,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:48:52,409 INFO L225 Difference]: With dead ends: 218 [2019-10-01 21:48:52,409 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 21:48:52,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 21:48:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 21:48:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-10-01 21:48:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 21:48:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-10-01 21:48:52,415 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2019-10-01 21:48:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:48:52,415 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-10-01 21:48:52,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 21:48:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-10-01 21:48:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 21:48:52,417 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:48:52,417 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:48:52,417 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:48:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:48:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1698842739, now seen corresponding path program 41 times [2019-10-01 21:48:52,418 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:48:52,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:48:52,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:52,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:48:52,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:48:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:48:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:48:53,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:48:53,384 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:48:53,444 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:50:09,816 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-10-01 21:50:09,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:50:09,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:50:09,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 732 proven. 169 refuted. 0 times theorem prover too weak. 2515 trivial. 0 not checked. [2019-10-01 21:50:10,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:10,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 16] total 58 [2019-10-01 21:50:10,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 21:50:10,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 21:50:10,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 21:50:10,265 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 58 states. [2019-10-01 21:50:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:10,462 INFO L93 Difference]: Finished difference Result 223 states and 235 transitions. [2019-10-01 21:50:10,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 21:50:10,463 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 214 [2019-10-01 21:50:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:10,464 INFO L225 Difference]: With dead ends: 223 [2019-10-01 21:50:10,465 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 21:50:10,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 21:50:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 21:50:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-10-01 21:50:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 21:50:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2019-10-01 21:50:10,473 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 214 [2019-10-01 21:50:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:10,473 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2019-10-01 21:50:10,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 21:50:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2019-10-01 21:50:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-01 21:50:10,475 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:10,475 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:10,475 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:10,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:10,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1200258067, now seen corresponding path program 42 times [2019-10-01 21:50:10,476 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:10,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:10,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:10,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:50:10,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-10-01 21:50:11,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:11,302 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:11,367 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:50:19,118 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 21:50:19,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:50:19,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 21:50:19,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 933 proven. 121 refuted. 0 times theorem prover too weak. 2694 trivial. 0 not checked. [2019-10-01 21:50:19,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:19,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 16] total 59 [2019-10-01 21:50:19,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 21:50:19,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 21:50:19,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1171, Invalid=2251, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 21:50:19,592 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 59 states. [2019-10-01 21:50:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:20,166 INFO L93 Difference]: Finished difference Result 230 states and 240 transitions. [2019-10-01 21:50:20,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 21:50:20,166 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 222 [2019-10-01 21:50:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:20,168 INFO L225 Difference]: With dead ends: 230 [2019-10-01 21:50:20,168 INFO L226 Difference]: Without dead ends: 164 [2019-10-01 21:50:20,169 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1351, Invalid=3619, Unknown=0, NotChecked=0, Total=4970 [2019-10-01 21:50:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-01 21:50:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-10-01 21:50:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 21:50:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-01 21:50:20,174 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 222 [2019-10-01 21:50:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:20,174 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-01 21:50:20,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 21:50:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-01 21:50:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-01 21:50:20,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:20,176 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:20,176 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:20,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1514417361, now seen corresponding path program 43 times [2019-10-01 21:50:20,176 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:20,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:20,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:20,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:50:20,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:50:21,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:21,285 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:21,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:50:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:21,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 21:50:21,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:50:21,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:21,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 21:50:21,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 21:50:21,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 21:50:21,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:50:21,513 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 48 states. [2019-10-01 21:50:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:21,679 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2019-10-01 21:50:21,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 21:50:21,679 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2019-10-01 21:50:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:21,680 INFO L225 Difference]: With dead ends: 234 [2019-10-01 21:50:21,681 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 21:50:21,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:50:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 21:50:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-10-01 21:50:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 21:50:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-10-01 21:50:21,687 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 228 [2019-10-01 21:50:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:21,687 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-10-01 21:50:21,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 21:50:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-10-01 21:50:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 21:50:21,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:21,689 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:21,689 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:21,690 INFO L82 PathProgramCache]: Analyzing trace with hash 45137553, now seen corresponding path program 44 times [2019-10-01 21:50:21,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:21,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:21,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:21,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:50:21,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:50:22,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:22,599 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:22,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:50:22,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:50:22,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:50:22,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 21:50:22,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:50:22,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:22,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-01 21:50:22,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 21:50:22,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 21:50:22,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:50:22,840 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 49 states. [2019-10-01 21:50:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:23,094 INFO L93 Difference]: Finished difference Result 236 states and 244 transitions. [2019-10-01 21:50:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 21:50:23,095 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 230 [2019-10-01 21:50:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:23,096 INFO L225 Difference]: With dead ends: 236 [2019-10-01 21:50:23,096 INFO L226 Difference]: Without dead ends: 168 [2019-10-01 21:50:23,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:50:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-01 21:50:23,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-10-01 21:50:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 21:50:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2019-10-01 21:50:23,107 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 230 [2019-10-01 21:50:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:23,107 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2019-10-01 21:50:23,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 21:50:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2019-10-01 21:50:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-01 21:50:23,109 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:23,110 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:23,110 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:23,111 INFO L82 PathProgramCache]: Analyzing trace with hash -166176397, now seen corresponding path program 45 times [2019-10-01 21:50:23,111 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:23,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:23,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:23,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:50:23,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:50:24,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:24,156 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:24,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:50:24,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 21:50:24,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:50:24,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 21:50:24,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 3129 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:50:25,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:25,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 15] total 62 [2019-10-01 21:50:25,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 21:50:25,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 21:50:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=2502, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 21:50:25,346 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 62 states. [2019-10-01 21:50:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:25,633 INFO L93 Difference]: Finished difference Result 241 states and 250 transitions. [2019-10-01 21:50:25,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 21:50:25,639 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 232 [2019-10-01 21:50:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:25,640 INFO L225 Difference]: With dead ends: 241 [2019-10-01 21:50:25,641 INFO L226 Difference]: Without dead ends: 173 [2019-10-01 21:50:25,642 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1280, Invalid=2502, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 21:50:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-01 21:50:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-10-01 21:50:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 21:50:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-01 21:50:25,647 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 232 [2019-10-01 21:50:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:25,648 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-01 21:50:25,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 21:50:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-01 21:50:25,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 21:50:25,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:25,649 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:25,650 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:25,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:25,650 INFO L82 PathProgramCache]: Analyzing trace with hash -847744813, now seen corresponding path program 46 times [2019-10-01 21:50:25,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:25,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:25,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:25,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:50:25,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:50:26,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:26,754 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:26,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:50:26,944 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:50:26,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:50:26,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-01 21:50:26,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:50:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:50:27,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:50:27,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-01 21:50:27,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 21:50:27,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 21:50:27,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:50:27,024 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 51 states. [2019-10-01 21:50:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:50:27,218 INFO L93 Difference]: Finished difference Result 244 states and 252 transitions. [2019-10-01 21:50:27,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 21:50:27,219 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 236 [2019-10-01 21:50:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:50:27,220 INFO L225 Difference]: With dead ends: 244 [2019-10-01 21:50:27,220 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 21:50:27,221 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:50:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 21:50:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-10-01 21:50:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-01 21:50:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2019-10-01 21:50:27,226 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 236 [2019-10-01 21:50:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:50:27,227 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2019-10-01 21:50:27,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 21:50:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2019-10-01 21:50:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-01 21:50:27,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:50:27,229 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:50:27,230 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:50:27,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:50:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1971004875, now seen corresponding path program 47 times [2019-10-01 21:50:27,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:50:27,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:50:27,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:27,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:50:27,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:50:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:50:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4336 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:50:28,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:50:28,286 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:50:28,365 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:52:41,143 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-10-01 21:52:41,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:52:41,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:52:41,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4336 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 3296 trivial. 0 not checked. [2019-10-01 21:52:41,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:41,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 17] total 66 [2019-10-01 21:52:41,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 21:52:41,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 21:52:41,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1410, Invalid=2880, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:52:41,650 INFO L87 Difference]: Start difference. First operand 173 states and 177 transitions. Second operand 66 states. [2019-10-01 21:52:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:41,975 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2019-10-01 21:52:41,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 21:52:41,976 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 238 [2019-10-01 21:52:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:41,977 INFO L225 Difference]: With dead ends: 249 [2019-10-01 21:52:41,977 INFO L226 Difference]: Without dead ends: 179 [2019-10-01 21:52:41,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1410, Invalid=2880, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:52:41,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-01 21:52:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-10-01 21:52:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-01 21:52:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-10-01 21:52:41,983 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 238 [2019-10-01 21:52:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:41,983 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-10-01 21:52:41,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 21:52:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-10-01 21:52:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-01 21:52:41,985 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:41,985 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 45, 45, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:52:41,985 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:41,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:41,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1090633579, now seen corresponding path program 48 times [2019-10-01 21:52:41,986 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:41,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:41,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:41,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:52:41,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2019-10-01 21:52:43,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:43,174 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:52:43,252 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:52:57,442 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 21:52:57,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:52:57,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:52:57,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 970 proven. 169 refuted. 0 times theorem prover too weak. 3561 trivial. 0 not checked. [2019-10-01 21:52:58,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:58,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 16] total 66 [2019-10-01 21:52:58,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 21:52:58,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 21:52:58,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=2845, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:52:58,061 INFO L87 Difference]: Start difference. First operand 177 states and 181 transitions. Second operand 66 states. [2019-10-01 21:52:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:58,443 INFO L93 Difference]: Finished difference Result 255 states and 264 transitions. [2019-10-01 21:52:58,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 21:52:58,444 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 246 [2019-10-01 21:52:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:58,445 INFO L225 Difference]: With dead ends: 255 [2019-10-01 21:52:58,446 INFO L226 Difference]: Without dead ends: 183 [2019-10-01 21:52:58,447 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1445, Invalid=2845, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:52:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-01 21:52:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-10-01 21:52:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 21:52:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-10-01 21:52:58,453 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 246 [2019-10-01 21:52:58,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:58,453 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-10-01 21:52:58,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 21:52:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-10-01 21:52:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 21:52:58,455 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:58,455 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:52:58,455 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:58,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:58,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1139151861, now seen corresponding path program 49 times [2019-10-01 21:52:58,456 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:52:58,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:52:58,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:58,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:52:58,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:52:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:52:59,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:52:59,539 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:52:59,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:52:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:52:59,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 21:52:59,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:52:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:52:59,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:52:59,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 21:52:59,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 21:52:59,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 21:52:59,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:52:59,809 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 54 states. [2019-10-01 21:52:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:52:59,986 INFO L93 Difference]: Finished difference Result 258 states and 266 transitions. [2019-10-01 21:52:59,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 21:52:59,990 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 250 [2019-10-01 21:52:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:52:59,991 INFO L225 Difference]: With dead ends: 258 [2019-10-01 21:52:59,991 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 21:52:59,992 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:52:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 21:52:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 21:52:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 21:52:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2019-10-01 21:52:59,997 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 250 [2019-10-01 21:52:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:52:59,997 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2019-10-01 21:52:59,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 21:52:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2019-10-01 21:52:59,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 21:52:59,999 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:52:59,999 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:52:59,999 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:52:59,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:52:59,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1601869353, now seen corresponding path program 50 times [2019-10-01 21:52:59,999 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:53:00,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:53:00,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:00,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:53:00,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:53:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:53:01,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:53:01,123 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:53:01,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:53:01,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:53:01,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:53:01,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 21:53:01,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:53:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:53:01,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:53:01,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-01 21:53:01,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 21:53:01,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 21:53:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:53:01,384 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 55 states. [2019-10-01 21:53:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:53:01,602 INFO L93 Difference]: Finished difference Result 260 states and 268 transitions. [2019-10-01 21:53:01,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 21:53:01,603 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 252 [2019-10-01 21:53:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:53:01,604 INFO L225 Difference]: With dead ends: 260 [2019-10-01 21:53:01,604 INFO L226 Difference]: Without dead ends: 186 [2019-10-01 21:53:01,605 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:53:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-01 21:53:01,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-10-01 21:53:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-01 21:53:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2019-10-01 21:53:01,610 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 252 [2019-10-01 21:53:01,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:53:01,611 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2019-10-01 21:53:01,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 21:53:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2019-10-01 21:53:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-01 21:53:01,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:53:01,613 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:53:01,613 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:53:01,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:53:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1386663737, now seen corresponding path program 51 times [2019-10-01 21:53:01,613 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:53:01,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:53:01,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:01,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:53:01,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:53:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5030 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:53:02,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:53:02,831 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:53:02,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:53:04,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 21:53:04,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:53:04,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 21:53:04,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:53:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5030 backedges. 970 proven. 196 refuted. 0 times theorem prover too weak. 3864 trivial. 0 not checked. [2019-10-01 21:53:04,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:53:04,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 17] total 70 [2019-10-01 21:53:04,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 21:53:04,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 21:53:04,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1620, Invalid=3210, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 21:53:04,591 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 70 states. [2019-10-01 21:53:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:53:04,851 INFO L93 Difference]: Finished difference Result 265 states and 274 transitions. [2019-10-01 21:53:04,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-01 21:53:04,852 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 254 [2019-10-01 21:53:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:53:04,853 INFO L225 Difference]: With dead ends: 265 [2019-10-01 21:53:04,854 INFO L226 Difference]: Without dead ends: 191 [2019-10-01 21:53:04,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1620, Invalid=3210, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 21:53:04,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-01 21:53:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2019-10-01 21:53:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 21:53:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2019-10-01 21:53:04,861 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 254 [2019-10-01 21:53:04,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:53:04,861 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2019-10-01 21:53:04,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 21:53:04,861 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2019-10-01 21:53:04,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-01 21:53:04,863 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:53:04,863 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:53:04,864 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:53:04,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:53:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1192363929, now seen corresponding path program 52 times [2019-10-01 21:53:04,864 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:53:04,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:53:04,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:04,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:53:04,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:53:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:53:06,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:53:06,077 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:53:06,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:53:06,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:53:06,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:53:06,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 21:53:06,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:53:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:53:06,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:53:06,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-01 21:53:06,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 21:53:06,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 21:53:06,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 21:53:06,345 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand 57 states. [2019-10-01 21:53:06,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:53:06,536 INFO L93 Difference]: Finished difference Result 268 states and 276 transitions. [2019-10-01 21:53:06,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 21:53:06,537 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 258 [2019-10-01 21:53:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:53:06,538 INFO L225 Difference]: With dead ends: 268 [2019-10-01 21:53:06,538 INFO L226 Difference]: Without dead ends: 192 [2019-10-01 21:53:06,539 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 21:53:06,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-01 21:53:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-10-01 21:53:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-01 21:53:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2019-10-01 21:53:06,544 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 258 [2019-10-01 21:53:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:53:06,545 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2019-10-01 21:53:06,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 21:53:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2019-10-01 21:53:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-01 21:53:06,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:53:06,547 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:53:06,547 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:53:06,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:53:06,547 INFO L82 PathProgramCache]: Analyzing trace with hash 838228859, now seen corresponding path program 53 times [2019-10-01 21:53:06,548 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:53:06,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:53:06,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:06,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:53:06,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:53:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:53:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5271 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:53:07,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:53:07,807 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:53:07,900 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:55:56,267 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-10-01 21:55:56,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:55:56,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 21:55:56,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:55:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5271 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 4082 trivial. 0 not checked. [2019-10-01 21:55:56,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:55:56,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 18] total 73 [2019-10-01 21:55:56,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 21:55:56,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 21:55:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 21:55:56,847 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 73 states. [2019-10-01 21:55:57,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:55:57,230 INFO L93 Difference]: Finished difference Result 273 states and 285 transitions. [2019-10-01 21:55:57,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 21:55:57,231 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 260 [2019-10-01 21:55:57,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:55:57,233 INFO L225 Difference]: With dead ends: 273 [2019-10-01 21:55:57,233 INFO L226 Difference]: Without dead ends: 197 [2019-10-01 21:55:57,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 21:55:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-01 21:55:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-10-01 21:55:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-01 21:55:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2019-10-01 21:55:57,241 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 260 [2019-10-01 21:55:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:55:57,241 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2019-10-01 21:55:57,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 21:55:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2019-10-01 21:55:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-01 21:55:57,246 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:55:57,246 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 48, 48, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:55:57,247 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:55:57,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:55:57,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1877138907, now seen corresponding path program 54 times [2019-10-01 21:55:57,247 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:55:57,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:55:57,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:57,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:55:57,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:55:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5665 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-10-01 21:55:58,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:55:58,584 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:55:58,680 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:56:15,640 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 21:56:15,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:56:15,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 21:56:15,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:56:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5665 backedges. 1207 proven. 225 refuted. 0 times theorem prover too weak. 4233 trivial. 0 not checked. [2019-10-01 21:56:16,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:56:16,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 20] total 76 [2019-10-01 21:56:16,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-01 21:56:16,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-01 21:56:16,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1922, Invalid=3778, Unknown=0, NotChecked=0, Total=5700 [2019-10-01 21:56:16,205 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 76 states. [2019-10-01 21:56:17,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:56:17,111 INFO L93 Difference]: Finished difference Result 280 states and 290 transitions. [2019-10-01 21:56:17,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-01 21:56:17,112 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 268 [2019-10-01 21:56:17,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:56:17,113 INFO L225 Difference]: With dead ends: 280 [2019-10-01 21:56:17,113 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 21:56:17,114 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2226, Invalid=6146, Unknown=0, NotChecked=0, Total=8372 [2019-10-01 21:56:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 21:56:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-01 21:56:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-01 21:56:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2019-10-01 21:56:17,118 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 268 [2019-10-01 21:56:17,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:56:17,119 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2019-10-01 21:56:17,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-01 21:56:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2019-10-01 21:56:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-01 21:56:17,121 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:56:17,121 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:56:17,121 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:56:17,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:56:17,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1685353117, now seen corresponding path program 55 times [2019-10-01 21:56:17,122 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:56:17,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:56:17,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:17,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:56:17,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:56:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:56:18,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:56:18,433 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:56:18,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:56:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:56:18,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 21:56:18,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:56:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:56:18,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:56:18,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-10-01 21:56:18,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 21:56:18,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 21:56:18,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:56:18,765 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 61 states. [2019-10-01 21:56:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:56:18,963 INFO L93 Difference]: Finished difference Result 284 states and 292 transitions. [2019-10-01 21:56:18,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 21:56:18,967 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 274 [2019-10-01 21:56:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:56:18,968 INFO L225 Difference]: With dead ends: 284 [2019-10-01 21:56:18,968 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 21:56:18,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:56:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 21:56:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-10-01 21:56:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-01 21:56:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 207 transitions. [2019-10-01 21:56:18,974 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 207 transitions. Word has length 274 [2019-10-01 21:56:18,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:56:18,974 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 207 transitions. [2019-10-01 21:56:18,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 21:56:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2019-10-01 21:56:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-01 21:56:18,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:56:18,976 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:56:18,977 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:56:18,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:56:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1346945663, now seen corresponding path program 56 times [2019-10-01 21:56:18,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:56:18,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:56:18,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:18,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:56:18,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:56:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:56:20,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:56:20,376 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:56:20,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:56:20,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:56:20,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:56:20,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-01 21:56:20,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:56:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:56:20,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:56:20,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-10-01 21:56:20,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 21:56:20,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 21:56:20,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 21:56:20,674 INFO L87 Difference]: Start difference. First operand 203 states and 207 transitions. Second operand 62 states. [2019-10-01 21:56:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:56:20,932 INFO L93 Difference]: Finished difference Result 286 states and 294 transitions. [2019-10-01 21:56:20,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 21:56:20,933 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 276 [2019-10-01 21:56:20,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:56:20,934 INFO L225 Difference]: With dead ends: 286 [2019-10-01 21:56:20,934 INFO L226 Difference]: Without dead ends: 206 [2019-10-01 21:56:20,935 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 21:56:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-01 21:56:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-10-01 21:56:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-01 21:56:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2019-10-01 21:56:20,940 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 276 [2019-10-01 21:56:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:56:20,941 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2019-10-01 21:56:20,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 21:56:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2019-10-01 21:56:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-01 21:56:20,943 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:56:20,943 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:56:20,943 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:56:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:56:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1740070431, now seen corresponding path program 57 times [2019-10-01 21:56:20,944 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:56:20,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:56:20,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:20,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:56:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:56:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6152 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:56:22,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:56:22,400 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:56:22,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:56:24,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-01 21:56:24,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:56:24,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:56:24,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:56:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6152 backedges. 1096 proven. 256 refuted. 0 times theorem prover too weak. 4800 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (59)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:56:25,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:56:25,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 19] total 79 [2019-10-01 21:56:25,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-01 21:56:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-01 21:56:25,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2061, Invalid=4101, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 21:56:25,059 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 79 states. [2019-10-01 21:56:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:56:25,471 INFO L93 Difference]: Finished difference Result 291 states and 303 transitions. [2019-10-01 21:56:25,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-01 21:56:25,472 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 278 [2019-10-01 21:56:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:56:25,474 INFO L225 Difference]: With dead ends: 291 [2019-10-01 21:56:25,474 INFO L226 Difference]: Without dead ends: 211 [2019-10-01 21:56:25,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2061, Invalid=4101, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 21:56:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-01 21:56:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-10-01 21:56:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-01 21:56:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 213 transitions. [2019-10-01 21:56:25,481 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 213 transitions. Word has length 278 [2019-10-01 21:56:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:56:25,481 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 213 transitions. [2019-10-01 21:56:25,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-01 21:56:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 213 transitions. [2019-10-01 21:56:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-01 21:56:25,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:56:25,483 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 51, 51, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:56:25,483 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:56:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:56:25,484 INFO L82 PathProgramCache]: Analyzing trace with hash -948377023, now seen corresponding path program 58 times [2019-10-01 21:56:25,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:56:25,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:56:25,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:25,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:56:25,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:56:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6574 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-10-01 21:56:27,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:56:27,067 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:56:27,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:56:27,316 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:56:27,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:56:27,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 21:56:27,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:56:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6574 backedges. 1232 proven. 289 refuted. 0 times theorem prover too weak. 5053 trivial. 0 not checked. [2019-10-01 21:56:27,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:56:27,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 20] total 81 [2019-10-01 21:56:27,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-10-01 21:56:27,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-10-01 21:56:27,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2142, Invalid=4338, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 21:56:27,907 INFO L87 Difference]: Start difference. First operand 209 states and 213 transitions. Second operand 81 states. [2019-10-01 21:56:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:56:28,341 INFO L93 Difference]: Finished difference Result 297 states and 309 transitions. [2019-10-01 21:56:28,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-01 21:56:28,341 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 286 [2019-10-01 21:56:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:56:28,342 INFO L225 Difference]: With dead ends: 297 [2019-10-01 21:56:28,342 INFO L226 Difference]: Without dead ends: 215 [2019-10-01 21:56:28,343 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2142, Invalid=4338, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 21:56:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-01 21:56:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-10-01 21:56:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-01 21:56:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2019-10-01 21:56:28,349 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 286 [2019-10-01 21:56:28,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:56:28,350 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2019-10-01 21:56:28,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-10-01 21:56:28,350 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2019-10-01 21:56:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-01 21:56:28,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:56:28,352 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 54, 54, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:56:28,352 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:56:28,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:56:28,353 INFO L82 PathProgramCache]: Analyzing trace with hash 325396641, now seen corresponding path program 59 times [2019-10-01 21:56:28,353 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:56:28,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:56:28,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:28,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:56:28,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:56:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:56:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7016 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 3295 trivial. 0 not checked. [2019-10-01 21:56:29,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:56:29,993 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:56:30,104 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:59:39,863 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2019-10-01 21:59:39,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:59:39,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 21:59:39,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:59:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 7016 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 5320 trivial. 0 not checked. [2019-10-01 21:59:40,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:59:40,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 21] total 83 [2019-10-01 21:59:40,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-01 21:59:40,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-01 21:59:40,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2225, Invalid=4581, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 21:59:40,560 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 83 states. [2019-10-01 21:59:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:59:40,999 INFO L93 Difference]: Finished difference Result 303 states and 315 transitions. [2019-10-01 21:59:40,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-01 21:59:40,999 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 294 [2019-10-01 21:59:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:59:41,000 INFO L225 Difference]: With dead ends: 303 [2019-10-01 21:59:41,000 INFO L226 Difference]: Without dead ends: 219 [2019-10-01 21:59:41,001 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2225, Invalid=4581, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 21:59:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-10-01 21:59:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-10-01 21:59:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-01 21:59:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 221 transitions. [2019-10-01 21:59:41,007 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 221 transitions. Word has length 294 [2019-10-01 21:59:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:59:41,007 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 221 transitions. [2019-10-01 21:59:41,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-01 21:59:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2019-10-01 21:59:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-01 21:59:41,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:59:41,010 INFO L411 BasicCegarLoop]: trace histogram [62, 62, 57, 57, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:59:41,010 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:59:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:59:41,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1791384833, now seen corresponding path program 60 times [2019-10-01 21:59:41,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:59:41,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:59:41,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:41,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:59:41,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:59:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7478 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 3634 trivial. 0 not checked. [2019-10-01 21:59:42,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:59:42,617 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:59:42,732 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:00:19,443 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 22:00:19,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:19,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:00:19,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7478 backedges. 1530 proven. 256 refuted. 0 times theorem prover too weak. 5692 trivial. 0 not checked. [2019-10-01 22:00:20,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:20,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 19] total 82 [2019-10-01 22:00:20,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 22:00:20,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 22:00:20,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2250, Invalid=4392, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:00:20,055 INFO L87 Difference]: Start difference. First operand 217 states and 221 transitions. Second operand 82 states. [2019-10-01 22:00:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:20,498 INFO L93 Difference]: Finished difference Result 309 states and 318 transitions. [2019-10-01 22:00:20,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 22:00:20,499 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 302 [2019-10-01 22:00:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:20,500 INFO L225 Difference]: With dead ends: 309 [2019-10-01 22:00:20,500 INFO L226 Difference]: Without dead ends: 223 [2019-10-01 22:00:20,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2250, Invalid=4392, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:00:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-10-01 22:00:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-10-01 22:00:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-01 22:00:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-01 22:00:20,507 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 302 [2019-10-01 22:00:20,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:20,508 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-01 22:00:20,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 22:00:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-01 22:00:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-01 22:00:20,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:20,510 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:20,510 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:20,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:20,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1467615391, now seen corresponding path program 61 times [2019-10-01 22:00:20,511 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:20,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:20,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:20,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:20,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:00:22,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:22,269 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:22,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:22,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-01 22:00:22,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:00:22,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:22,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-10-01 22:00:22,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 22:00:22,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 22:00:22,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:00:22,645 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 67 states. [2019-10-01 22:00:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:22,848 INFO L93 Difference]: Finished difference Result 312 states and 320 transitions. [2019-10-01 22:00:22,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:00:22,848 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 306 [2019-10-01 22:00:22,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:22,850 INFO L225 Difference]: With dead ends: 312 [2019-10-01 22:00:22,850 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 22:00:22,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:00:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 22:00:22,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-10-01 22:00:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-01 22:00:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 227 transitions. [2019-10-01 22:00:22,856 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 227 transitions. Word has length 306 [2019-10-01 22:00:22,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:22,857 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 227 transitions. [2019-10-01 22:00:22,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 22:00:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2019-10-01 22:00:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-01 22:00:22,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:22,859 INFO L411 BasicCegarLoop]: trace histogram [64, 64, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:22,859 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:22,860 INFO L82 PathProgramCache]: Analyzing trace with hash -271433917, now seen corresponding path program 62 times [2019-10-01 22:00:22,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:22,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:22,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:22,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:22,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:00:24,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:24,562 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:24,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:24,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:24,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:24,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 22:00:24,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:24,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:00:24,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:24,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-10-01 22:00:24,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 22:00:24,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 22:00:24,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:00:24,896 INFO L87 Difference]: Start difference. First operand 223 states and 227 transitions. Second operand 68 states. [2019-10-01 22:00:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:25,139 INFO L93 Difference]: Finished difference Result 314 states and 322 transitions. [2019-10-01 22:00:25,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 22:00:25,139 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 308 [2019-10-01 22:00:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:25,140 INFO L225 Difference]: With dead ends: 314 [2019-10-01 22:00:25,140 INFO L226 Difference]: Without dead ends: 226 [2019-10-01 22:00:25,141 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 22:00:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-01 22:00:25,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-10-01 22:00:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-01 22:00:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 229 transitions. [2019-10-01 22:00:25,148 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 229 transitions. Word has length 308 [2019-10-01 22:00:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:25,148 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 229 transitions. [2019-10-01 22:00:25,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 22:00:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2019-10-01 22:00:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-01 22:00:25,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:25,150 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:25,150 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:25,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:25,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1792272731, now seen corresponding path program 63 times [2019-10-01 22:00:25,151 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:25,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:25,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:25,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:25,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7892 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:00:26,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:26,850 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:26,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:31,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 22:00:31,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:31,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:00:31,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7892 backedges. 1530 proven. 289 refuted. 0 times theorem prover too weak. 6073 trivial. 0 not checked. [2019-10-01 22:00:31,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:31,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 20] total 86 [2019-10-01 22:00:31,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-01 22:00:31,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-01 22:00:31,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2467, Invalid=4843, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 22:00:31,676 INFO L87 Difference]: Start difference. First operand 225 states and 229 transitions. Second operand 86 states. [2019-10-01 22:00:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:32,063 INFO L93 Difference]: Finished difference Result 319 states and 328 transitions. [2019-10-01 22:00:32,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-01 22:00:32,064 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 310 [2019-10-01 22:00:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:32,066 INFO L225 Difference]: With dead ends: 319 [2019-10-01 22:00:32,066 INFO L226 Difference]: Without dead ends: 231 [2019-10-01 22:00:32,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2467, Invalid=4843, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 22:00:32,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-01 22:00:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2019-10-01 22:00:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-01 22:00:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2019-10-01 22:00:32,073 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 310 [2019-10-01 22:00:32,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:32,073 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2019-10-01 22:00:32,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-01 22:00:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2019-10-01 22:00:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-01 22:00:32,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:32,075 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 57, 57, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:32,076 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:32,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:32,076 INFO L82 PathProgramCache]: Analyzing trace with hash 809391621, now seen corresponding path program 64 times [2019-10-01 22:00:32,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:32,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:32,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:32,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:32,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-10-01 22:00:33,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:33,789 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:33,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:34,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:34,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:34,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:00:34,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 1528 proven. 361 refuted. 0 times theorem prover too weak. 6169 trivial. 0 not checked. [2019-10-01 22:00:34,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:34,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 22] total 89 [2019-10-01 22:00:34,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-01 22:00:34,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-01 22:00:34,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2576, Invalid=5256, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 22:00:34,744 INFO L87 Difference]: Start difference. First operand 229 states and 233 transitions. Second operand 89 states. [2019-10-01 22:00:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:35,311 INFO L93 Difference]: Finished difference Result 325 states and 337 transitions. [2019-10-01 22:00:35,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-01 22:00:35,312 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 314 [2019-10-01 22:00:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:35,313 INFO L225 Difference]: With dead ends: 325 [2019-10-01 22:00:35,313 INFO L226 Difference]: Without dead ends: 235 [2019-10-01 22:00:35,315 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2576, Invalid=5256, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 22:00:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-01 22:00:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-01 22:00:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-01 22:00:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 237 transitions. [2019-10-01 22:00:35,322 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 237 transitions. Word has length 314 [2019-10-01 22:00:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:35,322 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 237 transitions. [2019-10-01 22:00:35,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-01 22:00:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2019-10-01 22:00:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-01 22:00:35,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:35,325 INFO L411 BasicCegarLoop]: trace histogram [67, 67, 60, 60, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:35,325 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash -564254619, now seen corresponding path program 65 times [2019-10-01 22:00:35,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:35,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:35,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:35,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:35,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8548 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 4059 trivial. 0 not checked. [2019-10-01 22:00:37,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:37,308 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:37,439 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1