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/reducercommutativity/avg40-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:01:52,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:01:52,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:01:52,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:01:52,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:01:52,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:01:52,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:01:52,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:01:52,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:01:52,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:01:52,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:01:52,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:01:52,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:01:52,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:01:52,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:01:52,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:01:52,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:01:52,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:01:52,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:01:52,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:01:52,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:01:52,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:01:52,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:01:52,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:01:52,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:01:52,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:01:52,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:01:52,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:01:52,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:01:52,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:01:52,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:01:52,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:01:52,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:01:52,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:01:52,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:01:52,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:01:52,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:01:52,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:01:52,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:01:52,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:01:52,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:01:52,382 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 11:01:52,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:01:52,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:01:52,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:01:52,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:01:52,398 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:01:52,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:01:52,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:01:52,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:01:52,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:01:52,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:01:52,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:01:52,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:01:52,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:01:52,400 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:01:52,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:01:52,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:01:52,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:01:52,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:01:52,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:01:52,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:01:52,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:01:52,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:01:52,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:01:52,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:01:52,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:01:52,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:01:52,403 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:01:52,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:01:52,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:01:52,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:01:52,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:01:52,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:01:52,453 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:01:52,454 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:01:52,454 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/avg40-2.i [2019-09-07 11:01:52,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fc87579/014c2b6594314962b4e8c86babd44c50/FLAG5bf7730c6 [2019-09-07 11:01:53,026 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:01:53,027 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg40-2.i [2019-09-07 11:01:53,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fc87579/014c2b6594314962b4e8c86babd44c50/FLAG5bf7730c6 [2019-09-07 11:01:53,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5fc87579/014c2b6594314962b4e8c86babd44c50 [2019-09-07 11:01:53,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:01:53,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:01:53,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:01:53,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:01:53,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:01:53,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:01:53" (1/1) ... [2019-09-07 11:01:53,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246ebc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:01:53, skipping insertion in model container [2019-09-07 11:01:53,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:01:53" (1/1) ... [2019-09-07 11:01:53,394 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:01:53,411 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:01:53,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:01:53,607 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:01:53,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:01:53,647 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:01:53,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:01:53 WrapperNode [2019-09-07 11:01:53,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:01:53,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:01:53,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:01:53,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:01:53,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:01:53" (1/1) ... [2019-09-07 11:01:53,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:01:53" (1/1) ... [2019-09-07 11:01:53,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:01:53" (1/1) ... [2019-09-07 11:01:53,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:01:53" (1/1) ... [2019-09-07 11:01:53,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:01:53" (1/1) ... [2019-09-07 11:01:53,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:01:53" (1/1) ... [2019-09-07 11:01:53,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:01:53" (1/1) ... [2019-09-07 11:01:53,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:01:53,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:01:53,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:01:53,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:01:53,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:01:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:01:53,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:01:53,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:01:53,849 INFO L138 BoogieDeclarations]: Found implementation of procedure avg [2019-09-07 11:01:53,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:01:53,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:01:53,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:01:53,849 INFO L130 BoogieDeclarations]: Found specification of procedure avg [2019-09-07 11:01:53,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:01:53,849 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:01:53,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 11:01:53,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:01:53,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:01:53,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:01:53,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:01:54,182 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:01:54,182 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 11:01:54,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:01:54 BoogieIcfgContainer [2019-09-07 11:01:54,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:01:54,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:01:54,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:01:54,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:01:54,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:01:53" (1/3) ... [2019-09-07 11:01:54,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338e3781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:01:54, skipping insertion in model container [2019-09-07 11:01:54,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:01:53" (2/3) ... [2019-09-07 11:01:54,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338e3781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:01:54, skipping insertion in model container [2019-09-07 11:01:54,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:01:54" (3/3) ... [2019-09-07 11:01:54,192 INFO L109 eAbstractionObserver]: Analyzing ICFG avg40-2.i [2019-09-07 11:01:54,202 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:01:54,209 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:01:54,225 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:01:54,254 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:01:54,255 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:01:54,255 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:01:54,255 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:01:54,255 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:01:54,255 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:01:54,255 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:01:54,255 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:01:54,255 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:01:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-09-07 11:01:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:01:54,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:54,279 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:01:54,281 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:54,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:54,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2019-09-07 11:01:54,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:54,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:54,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:54,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:01:54,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:01:54,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:01:54,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 11:01:54,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 11:01:54,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 11:01:54,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:01:54,481 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-09-07 11:01:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:54,508 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-09-07 11:01:54,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 11:01:54,509 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-09-07 11:01:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:54,519 INFO L225 Difference]: With dead ends: 54 [2019-09-07 11:01:54,519 INFO L226 Difference]: Without dead ends: 26 [2019-09-07 11:01:54,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:01:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-07 11:01:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-07 11:01:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-07 11:01:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-07 11:01:54,568 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-09-07 11:01:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:54,569 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-07 11:01:54,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 11:01:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-07 11:01:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:01:54,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:54,572 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:01:54,573 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2019-09-07 11:01:54,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:54,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:54,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:54,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:01:54,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:01:54,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:01:54,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:01:54,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:01:54,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:01:54,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:01:54,650 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-09-07 11:01:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:54,671 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-09-07 11:01:54,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:01:54,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 11:01:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:54,674 INFO L225 Difference]: With dead ends: 46 [2019-09-07 11:01:54,674 INFO L226 Difference]: Without dead ends: 28 [2019-09-07 11:01:54,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:01:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-07 11:01:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-07 11:01:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 11:01:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-07 11:01:54,683 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-09-07 11:01:54,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:54,684 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-07 11:01:54,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:01:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-07 11:01:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 11:01:54,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:54,686 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:01:54,686 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:54,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:54,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2019-09-07 11:01:54,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:54,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:54,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:01:54,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 11:01:54,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:54,813 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:54,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:01:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:54,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 11:01:54,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 11:01:54,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:01:54,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 11:01:54,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:01:54,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:01:54,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:01:54,938 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-09-07 11:01:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:54,967 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-09-07 11:01:54,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:01:54,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-07 11:01:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:54,969 INFO L225 Difference]: With dead ends: 46 [2019-09-07 11:01:54,969 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 11:01:54,970 INFO L628 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-09-07 11:01:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 11:01:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-07 11:01:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 11:01:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-07 11:01:54,976 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-09-07 11:01:54,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:54,977 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-07 11:01:54,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:01:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-07 11:01:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 11:01:54,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:54,979 INFO L399 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-09-07 11:01:54,979 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:54,980 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2019-09-07 11:01:54,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:54,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:54,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:54,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:01:54,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 11:01:55,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:01:55,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:01:55,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:01:55,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:01:55,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:01:55,077 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-09-07 11:01:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:55,103 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-09-07 11:01:55,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:01:55,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-09-07 11:01:55,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:55,108 INFO L225 Difference]: With dead ends: 43 [2019-09-07 11:01:55,109 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 11:01:55,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:01:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 11:01:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-07 11:01:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 11:01:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-07 11:01:55,120 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-09-07 11:01:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:55,126 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-07 11:01:55,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:01:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-07 11:01:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 11:01:55,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:55,129 INFO L399 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-09-07 11:01:55,130 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:55,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:55,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2019-09-07 11:01:55,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:55,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:55,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:01:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 11:01:55,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:55,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:55,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:01:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:55,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:01:55,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:55,345 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-09-07 11:01:55,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:55,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 11:01:55,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:01:55,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:01:55,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:01:55,361 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-09-07 11:01:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:55,409 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-09-07 11:01:55,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:01:55,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-09-07 11:01:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:55,413 INFO L225 Difference]: With dead ends: 52 [2019-09-07 11:01:55,413 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 11:01:55,415 INFO L628 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-09-07 11:01:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 11:01:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-07 11:01:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 11:01:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-07 11:01:55,426 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-09-07 11:01:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:55,427 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-07 11:01:55,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:01:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-07 11:01:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 11:01:55,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:55,428 INFO L399 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-09-07 11:01:55,429 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:55,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:55,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2019-09-07 11:01:55,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:55,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:55,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:55,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:01:55,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 11:01:55,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:55,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:01:55,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:55,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:01:55,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:01:55,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:01:55,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:01:55,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:55,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 11:01:55,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:01:55,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:01:55,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:01:55,648 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 7 states. [2019-09-07 11:01:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:55,705 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2019-09-07 11:01:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:01:55,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-09-07 11:01:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:55,707 INFO L225 Difference]: With dead ends: 57 [2019-09-07 11:01:55,708 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 11:01:55,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:01:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 11:01:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-07 11:01:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-07 11:01:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-07 11:01:55,716 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 44 [2019-09-07 11:01:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:55,716 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-07 11:01:55,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:01:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-07 11:01:55,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 11:01:55,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:55,718 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 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-09-07 11:01:55,721 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1603223851, now seen corresponding path program 3 times [2019-09-07 11:01:55,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:55,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:55,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:01:55,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 11:01:55,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:55,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:01:55,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:55,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:01:55,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:01:55,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:01:55,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:01:55,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:55,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-09-07 11:01:55,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:01:55,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:01:55,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:01:55,959 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2019-09-07 11:01:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:56,006 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-09-07 11:01:56,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:01:56,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-09-07 11:01:56,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:56,007 INFO L225 Difference]: With dead ends: 62 [2019-09-07 11:01:56,008 INFO L226 Difference]: Without dead ends: 41 [2019-09-07 11:01:56,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:01:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-07 11:01:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-09-07 11:01:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-07 11:01:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-07 11:01:56,015 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 52 [2019-09-07 11:01:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:56,015 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-07 11:01:56,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:01:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-07 11:01:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 11:01:56,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:56,017 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 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] [2019-09-07 11:01:56,017 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:56,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:56,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1137374119, now seen corresponding path program 4 times [2019-09-07 11:01:56,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:56,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:56,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:56,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:01:56,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-07 11:01:56,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:56,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:56,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:01:56,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:01:56,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:01:56,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:01:56,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-07 11:01:56,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:56,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:01:56,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:01:56,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:01:56,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:01:56,204 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2019-09-07 11:01:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:56,271 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2019-09-07 11:01:56,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:01:56,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-09-07 11:01:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:56,272 INFO L225 Difference]: With dead ends: 68 [2019-09-07 11:01:56,272 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 11:01:56,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:01:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 11:01:56,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-07 11:01:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-07 11:01:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-07 11:01:56,287 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 60 [2019-09-07 11:01:56,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:56,288 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-07 11:01:56,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:01:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-07 11:01:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 11:01:56,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:56,292 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 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-09-07 11:01:56,293 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:56,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:56,293 INFO L82 PathProgramCache]: Analyzing trace with hash 402688265, now seen corresponding path program 5 times [2019-09-07 11:01:56,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:56,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:56,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:56,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:01:56,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 11:01:56,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:56,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:01:56,425 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-09-07 11:01:56,501 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-07 11:01:56,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:01:56,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:01:56,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 52 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-07 11:01:56,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:56,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:01:56,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:01:56,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:01:56,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:01:56,541 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2019-09-07 11:01:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:56,575 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-09-07 11:01:56,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:01:56,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-09-07 11:01:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:56,578 INFO L225 Difference]: With dead ends: 69 [2019-09-07 11:01:56,589 INFO L226 Difference]: Without dead ends: 44 [2019-09-07 11:01:56,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:01:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-07 11:01:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-07 11:01:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 11:01:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-07 11:01:56,603 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 62 [2019-09-07 11:01:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:56,603 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-07 11:01:56,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:01:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-07 11:01:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 11:01:56,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:56,605 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 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-09-07 11:01:56,607 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:56,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:56,608 INFO L82 PathProgramCache]: Analyzing trace with hash -489208825, now seen corresponding path program 6 times [2019-09-07 11:01:56,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:56,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:56,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:56,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:01:56,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-07 11:01:56,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:56,708 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:01:56,734 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:56,805 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 11:01:56,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:01:56,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:01:56,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:01:56,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:56,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 11:01:56,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:01:56,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:01:56,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:01:56,839 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2019-09-07 11:01:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:56,876 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-09-07 11:01:56,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:01:56,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-07 11:01:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:56,878 INFO L225 Difference]: With dead ends: 65 [2019-09-07 11:01:56,878 INFO L226 Difference]: Without dead ends: 46 [2019-09-07 11:01:56,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:01:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-07 11:01:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-07 11:01:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-07 11:01:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-07 11:01:56,887 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 68 [2019-09-07 11:01:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:56,888 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-07 11:01:56,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:01:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-07 11:01:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 11:01:56,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:56,893 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 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-09-07 11:01:56,893 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:56,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1862159493, now seen corresponding path program 7 times [2019-09-07 11:01:56,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:56,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:56,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:01:56,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-07 11:01:56,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:56,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:56,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:01:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:57,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 11:01:57,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-07 11:01:57,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:57,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 11:01:57,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 11:01:57,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 11:01:57,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:01:57,077 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 8 states. [2019-09-07 11:01:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:57,126 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-09-07 11:01:57,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:01:57,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-09-07 11:01:57,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:57,129 INFO L225 Difference]: With dead ends: 78 [2019-09-07 11:01:57,129 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 11:01:57,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:01:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 11:01:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-07 11:01:57,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 11:01:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-07 11:01:57,149 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 70 [2019-09-07 11:01:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:57,149 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-07 11:01:57,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 11:01:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-07 11:01:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 11:01:57,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:57,154 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 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-09-07 11:01:57,155 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:57,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1619660647, now seen corresponding path program 8 times [2019-09-07 11:01:57,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:57,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:57,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:57,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:01:57,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-07 11:01:57,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:57,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:01:57,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:57,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:01:57,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:01:57,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:01:57,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-07 11:01:57,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:57,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 11:01:57,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:01:57,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:01:57,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:01:57,423 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 13 states. [2019-09-07 11:01:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:57,497 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2019-09-07 11:01:57,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 11:01:57,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-09-07 11:01:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:57,500 INFO L225 Difference]: With dead ends: 83 [2019-09-07 11:01:57,501 INFO L226 Difference]: Without dead ends: 53 [2019-09-07 11:01:57,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:01:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-07 11:01:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-09-07 11:01:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 11:01:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-07 11:01:57,511 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 72 [2019-09-07 11:01:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:57,512 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-07 11:01:57,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:01:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-07 11:01:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 11:01:57,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:57,514 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 6, 6, 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-09-07 11:01:57,514 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:57,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:57,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1874144199, now seen corresponding path program 9 times [2019-09-07 11:01:57,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:57,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:57,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:57,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:01:57,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-07 11:01:57,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:57,597 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:57,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:01:57,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 11:01:57,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:01:57,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:01:57,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-07 11:01:57,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:57,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:01:57,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:01:57,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:01:57,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:01:57,703 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2019-09-07 11:01:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:57,732 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-09-07 11:01:57,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:01:57,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-09-07 11:01:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:57,733 INFO L225 Difference]: With dead ends: 75 [2019-09-07 11:01:57,733 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 11:01:57,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:01:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 11:01:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-07 11:01:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 11:01:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-07 11:01:57,740 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 80 [2019-09-07 11:01:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:57,740 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-07 11:01:57,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:01:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-07 11:01:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 11:01:57,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:57,741 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 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] [2019-09-07 11:01:57,742 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash -656788411, now seen corresponding path program 10 times [2019-09-07 11:01:57,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:57,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:57,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:57,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:01:57,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 11:01:57,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:57,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:01:57,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:57,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:01:57,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:01:57,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:01:57,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:01:57,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:57,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 11:01:57,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 11:01:57,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 11:01:57,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:01:57,924 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 9 states. [2019-09-07 11:01:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:57,960 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2019-09-07 11:01:57,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 11:01:57,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-07 11:01:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:57,961 INFO L225 Difference]: With dead ends: 89 [2019-09-07 11:01:57,961 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 11:01:57,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:01:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 11:01:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-07 11:01:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-07 11:01:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-07 11:01:57,974 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 82 [2019-09-07 11:01:57,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:57,975 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-07 11:01:57,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 11:01:57,975 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-07 11:01:57,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-07 11:01:57,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:57,977 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 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] [2019-09-07 11:01:57,978 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:57,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:57,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1875710019, now seen corresponding path program 11 times [2019-09-07 11:01:57,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:57,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:57,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:57,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:01:57,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2019-09-07 11:01:58,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:58,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:01:58,088 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:58,263 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-07 11:01:58,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:01:58,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:01:58,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:01:58,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:58,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-07 11:01:58,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 11:01:58,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 11:01:58,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:01:58,343 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 14 states. [2019-09-07 11:01:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:58,443 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-09-07 11:01:58,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 11:01:58,445 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2019-09-07 11:01:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:58,446 INFO L225 Difference]: With dead ends: 96 [2019-09-07 11:01:58,447 INFO L226 Difference]: Without dead ends: 61 [2019-09-07 11:01:58,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:01:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-07 11:01:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-07 11:01:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-07 11:01:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-07 11:01:58,458 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 88 [2019-09-07 11:01:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:58,458 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-07 11:01:58,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 11:01:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-07 11:01:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 11:01:58,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:58,461 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 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] [2019-09-07 11:01:58,461 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:58,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:58,461 INFO L82 PathProgramCache]: Analyzing trace with hash 600475583, now seen corresponding path program 12 times [2019-09-07 11:01:58,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:58,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:58,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:58,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:01:58,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-09-07 11:01:58,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:58,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:58,573 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:01:58,760 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 11:01:58,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:01:58,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:01:58,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:01:58,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:58,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-07 11:01:58,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:01:58,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:01:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:01:58,874 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 15 states. [2019-09-07 11:01:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:58,965 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2019-09-07 11:01:58,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:01:58,966 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-09-07 11:01:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:58,967 INFO L225 Difference]: With dead ends: 105 [2019-09-07 11:01:58,967 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 11:01:58,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:01:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 11:01:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-09-07 11:01:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-07 11:01:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-07 11:01:58,983 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 96 [2019-09-07 11:01:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:58,984 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-07 11:01:58,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:01:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-07 11:01:58,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 11:01:58,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:58,986 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 7, 7, 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-09-07 11:01:58,986 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:58,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:58,987 INFO L82 PathProgramCache]: Analyzing trace with hash -721236449, now seen corresponding path program 13 times [2019-09-07 11:01:58,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:58,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:58,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:58,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:01:58,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 11:01:59,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:59,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:59,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:01:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:59,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 11:01:59,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 11:01:59,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:59,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 11:01:59,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 11:01:59,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 11:01:59,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:01:59,253 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 11 states. [2019-09-07 11:01:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:59,298 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-09-07 11:01:59,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:01:59,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2019-09-07 11:01:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:59,300 INFO L225 Difference]: With dead ends: 108 [2019-09-07 11:01:59,300 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 11:01:59,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:01:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 11:01:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-07 11:01:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-07 11:01:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-07 11:01:59,306 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 100 [2019-09-07 11:01:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:59,307 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-07 11:01:59,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 11:01:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-07 11:01:59,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 11:01:59,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:59,309 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 8, 8, 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-09-07 11:01:59,309 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:59,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:59,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1634739839, now seen corresponding path program 14 times [2019-09-07 11:01:59,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:59,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:59,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:59,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:01:59,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:01:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2019-09-07 11:01:59,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:01:59,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:01:59,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:01:59,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:01:59,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:01:59,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:01:59,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:01:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 11:01:59,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:01:59,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 11:01:59,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:01:59,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:01:59,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:01:59,853 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 19 states. [2019-09-07 11:01:59,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:01:59,972 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-09-07 11:01:59,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:01:59,972 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 102 [2019-09-07 11:01:59,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:01:59,973 INFO L225 Difference]: With dead ends: 113 [2019-09-07 11:01:59,973 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 11:01:59,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:01:59,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 11:01:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-09-07 11:01:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-07 11:01:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-07 11:01:59,984 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 102 [2019-09-07 11:01:59,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:01:59,984 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-07 11:01:59,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:01:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-07 11:01:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 11:01:59,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:01:59,986 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 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] [2019-09-07 11:01:59,986 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:01:59,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:01:59,987 INFO L82 PathProgramCache]: Analyzing trace with hash -550576159, now seen corresponding path program 15 times [2019-09-07 11:01:59,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:01:59,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:01:59,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:01:59,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:01:59,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2019-09-07 11:02:00,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:00,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:02:00,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:00,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 11:02:00,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:00,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:02:00,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-09-07 11:02:00,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:00,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 11:02:00,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 11:02:00,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 11:02:00,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:02:00,321 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 10 states. [2019-09-07 11:02:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:00,360 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-09-07 11:02:00,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 11:02:00,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2019-09-07 11:02:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:00,362 INFO L225 Difference]: With dead ends: 99 [2019-09-07 11:02:00,362 INFO L226 Difference]: Without dead ends: 72 [2019-09-07 11:02:00,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:02:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-07 11:02:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-07 11:02:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-07 11:02:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-09-07 11:02:00,367 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 110 [2019-09-07 11:02:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:00,369 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-09-07 11:02:00,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 11:02:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-09-07 11:02:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 11:02:00,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:00,370 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 9, 9, 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-09-07 11:02:00,371 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:00,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:00,371 INFO L82 PathProgramCache]: Analyzing trace with hash 878320095, now seen corresponding path program 16 times [2019-09-07 11:02:00,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:00,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:00,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:00,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:00,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-09-07 11:02:00,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:00,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:02:00,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:00,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:02:00,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:00,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:02:00,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-09-07 11:02:00,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:00,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-09-07 11:02:00,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 11:02:00,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 11:02:00,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:02:00,740 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 21 states. [2019-09-07 11:02:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:00,826 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2019-09-07 11:02:00,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 11:02:00,827 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 112 [2019-09-07 11:02:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:00,828 INFO L225 Difference]: With dead ends: 123 [2019-09-07 11:02:00,828 INFO L226 Difference]: Without dead ends: 77 [2019-09-07 11:02:00,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:02:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-07 11:02:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-09-07 11:02:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-07 11:02:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-09-07 11:02:00,833 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 112 [2019-09-07 11:02:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:00,834 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-09-07 11:02:00,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 11:02:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-09-07 11:02:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-07 11:02:00,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:00,835 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 10, 10, 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-09-07 11:02:00,836 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:00,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:00,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1924501953, now seen corresponding path program 17 times [2019-09-07 11:02:00,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:00,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:00,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:00,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:00,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2019-09-07 11:02:00,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:00,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:02:00,968 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:01,774 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-09-07 11:02:01,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:01,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:02:01,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2019-09-07 11:02:01,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:01,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-07 11:02:01,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:02:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:02:01,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:02:01,957 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-09-07 11:02:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:02,059 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2019-09-07 11:02:02,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:02:02,059 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 120 [2019-09-07 11:02:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:02,060 INFO L225 Difference]: With dead ends: 128 [2019-09-07 11:02:02,060 INFO L226 Difference]: Without dead ends: 81 [2019-09-07 11:02:02,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:02:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-07 11:02:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-09-07 11:02:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 11:02:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-09-07 11:02:02,065 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 120 [2019-09-07 11:02:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:02,066 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-09-07 11:02:02,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:02:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-09-07 11:02:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-07 11:02:02,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:02,068 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 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-09-07 11:02:02,068 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:02,068 INFO L82 PathProgramCache]: Analyzing trace with hash 457316027, now seen corresponding path program 18 times [2019-09-07 11:02:02,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:02,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:02,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:02,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:02,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2019-09-07 11:02:02,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:02,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:02,200 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:02:02,489 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 11:02:02,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:02,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:02:02,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 11:02:02,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:02,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 11:02:02,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 11:02:02,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 11:02:02,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 11:02:02,545 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 12 states. [2019-09-07 11:02:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:02,586 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-09-07 11:02:02,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 11:02:02,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2019-09-07 11:02:02,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:02,588 INFO L225 Difference]: With dead ends: 113 [2019-09-07 11:02:02,588 INFO L226 Difference]: Without dead ends: 82 [2019-09-07 11:02:02,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 11:02:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-07 11:02:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-07 11:02:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 11:02:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-09-07 11:02:02,593 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 128 [2019-09-07 11:02:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:02,593 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-09-07 11:02:02,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 11:02:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-09-07 11:02:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 11:02:02,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:02,595 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 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-09-07 11:02:02,595 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:02,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash -70196679, now seen corresponding path program 19 times [2019-09-07 11:02:02,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:02,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:02,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:02,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:02,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-09-07 11:02:02,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:02,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:02:02,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:02,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 11:02:02,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-09-07 11:02:02,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:02,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 11:02:02,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 11:02:02,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 11:02:02,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:02:02,840 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 14 states. [2019-09-07 11:02:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:02,882 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-09-07 11:02:02,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 11:02:02,883 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-09-07 11:02:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:02,884 INFO L225 Difference]: With dead ends: 138 [2019-09-07 11:02:02,884 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 11:02:02,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:02:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 11:02:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-07 11:02:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 11:02:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-09-07 11:02:02,889 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 130 [2019-09-07 11:02:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:02,889 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-09-07 11:02:02,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 11:02:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-09-07 11:02:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-07 11:02:02,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:02,891 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 11, 11, 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-09-07 11:02:02,891 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:02,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:02,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1381324315, now seen corresponding path program 20 times [2019-09-07 11:02:02,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:02,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:02,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:02,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:02:02,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2019-09-07 11:02:03,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:03,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:03,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:02:03,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:02:03,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:03,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 11:02:03,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:02:03,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:03,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 11:02:03,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:02:03,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:02:03,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:02:03,302 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 25 states. [2019-09-07 11:02:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:03,407 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-09-07 11:02:03,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 11:02:03,408 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2019-09-07 11:02:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:03,409 INFO L225 Difference]: With dead ends: 143 [2019-09-07 11:02:03,409 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 11:02:03,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:02:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 11:02:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-09-07 11:02:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-07 11:02:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-09-07 11:02:03,414 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 132 [2019-09-07 11:02:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:03,414 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-09-07 11:02:03,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:02:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-09-07 11:02:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 11:02:03,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:03,415 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 12, 12, 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-09-07 11:02:03,416 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:03,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:03,416 INFO L82 PathProgramCache]: Analyzing trace with hash 916997755, now seen corresponding path program 21 times [2019-09-07 11:02:03,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:03,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:03,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1314 trivial. 0 not checked. [2019-09-07 11:02:03,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:03,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:03,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:02:03,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 11:02:03,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:03,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:02:03,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 538 proven. 81 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2019-09-07 11:02:03,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:03,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 11:02:03,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:02:03,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:02:03,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:02:03,851 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 13 states. [2019-09-07 11:02:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:03,890 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-09-07 11:02:03,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 11:02:03,890 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 140 [2019-09-07 11:02:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:03,891 INFO L225 Difference]: With dead ends: 123 [2019-09-07 11:02:03,892 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 11:02:03,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:02:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 11:02:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-07 11:02:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-07 11:02:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-09-07 11:02:03,896 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 140 [2019-09-07 11:02:03,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:03,896 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-09-07 11:02:03,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:02:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-09-07 11:02:03,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 11:02:03,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:03,898 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 12, 12, 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-09-07 11:02:03,898 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:03,898 INFO L82 PathProgramCache]: Analyzing trace with hash -983887367, now seen corresponding path program 22 times [2019-09-07 11:02:03,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:03,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:03,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:03,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:03,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 0 proven. 657 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-09-07 11:02:04,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:04,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:02:04,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:04,124 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:02:04,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:04,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 11:02:04,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-09-07 11:02:04,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:04,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 11:02:04,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:02:04,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:02:04,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:02:04,166 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 15 states. [2019-09-07 11:02:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:04,214 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2019-09-07 11:02:04,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 11:02:04,216 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2019-09-07 11:02:04,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:04,218 INFO L225 Difference]: With dead ends: 149 [2019-09-07 11:02:04,218 INFO L226 Difference]: Without dead ends: 92 [2019-09-07 11:02:04,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:02:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-07 11:02:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-07 11:02:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-07 11:02:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-09-07 11:02:04,225 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 142 [2019-09-07 11:02:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:04,226 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2019-09-07 11:02:04,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:02:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2019-09-07 11:02:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-07 11:02:04,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:04,227 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 12, 12, 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-09-07 11:02:04,227 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash 31936759, now seen corresponding path program 23 times [2019-09-07 11:02:04,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:04,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:04,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:04,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:04,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1627 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2019-09-07 11:02:04,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:04,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:04,476 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:02:07,180 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-09-07 11:02:07,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:07,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 11:02:07,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1627 backedges. 628 proven. 144 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:02:07,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:07,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-09-07 11:02:07,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:02:07,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:02:07,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:02:07,382 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 26 states. [2019-09-07 11:02:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:07,470 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-09-07 11:02:07,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 11:02:07,472 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 148 [2019-09-07 11:02:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:07,473 INFO L225 Difference]: With dead ends: 156 [2019-09-07 11:02:07,473 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 11:02:07,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:02:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 11:02:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-09-07 11:02:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-07 11:02:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-09-07 11:02:07,484 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 148 [2019-09-07 11:02:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:07,484 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-09-07 11:02:07,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:02:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-09-07 11:02:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 11:02:07,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:07,488 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 12, 12, 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-09-07 11:02:07,488 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:07,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:07,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1045139853, now seen corresponding path program 24 times [2019-09-07 11:02:07,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:07,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:07,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:07,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:07,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1879 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-09-07 11:02:07,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:07,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:02:07,679 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:09,206 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 11:02:09,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:09,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:02:09,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1879 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Stream closed [2019-09-07 11:02:09,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:09,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 11:02:09,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 11:02:09,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 11:02:09,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:02:09,254 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 16 states. [2019-09-07 11:02:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:09,330 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2019-09-07 11:02:09,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:02:09,331 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 156 [2019-09-07 11:02:09,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:09,332 INFO L225 Difference]: With dead ends: 162 [2019-09-07 11:02:09,332 INFO L226 Difference]: Without dead ends: 98 [2019-09-07 11:02:09,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:02:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-07 11:02:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-07 11:02:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-07 11:02:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-09-07 11:02:09,338 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 156 [2019-09-07 11:02:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:09,338 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-09-07 11:02:09,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 11:02:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-09-07 11:02:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 11:02:09,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:09,340 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 13, 13, 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-09-07 11:02:09,340 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:09,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1062202325, now seen corresponding path program 25 times [2019-09-07 11:02:09,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:09,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:09,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:09,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:09,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1783 trivial. 0 not checked. [2019-09-07 11:02:09,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:09,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:02:09,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:09,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 11:02:09,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-09-07 11:02:09,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:09,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-09-07 11:02:09,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:02:09,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:02:09,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:02:09,795 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 28 states. [2019-09-07 11:02:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:09,905 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2019-09-07 11:02:09,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 11:02:09,910 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 158 [2019-09-07 11:02:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:09,911 INFO L225 Difference]: With dead ends: 167 [2019-09-07 11:02:09,912 INFO L226 Difference]: Without dead ends: 103 [2019-09-07 11:02:09,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:02:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-07 11:02:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-09-07 11:02:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-07 11:02:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2019-09-07 11:02:09,918 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 158 [2019-09-07 11:02:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:09,919 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2019-09-07 11:02:09,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:02:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2019-09-07 11:02:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-07 11:02:09,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:09,920 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 14, 14, 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-09-07 11:02:09,920 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:09,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:09,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2062113483, now seen corresponding path program 26 times [2019-09-07 11:02:09,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:09,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:09,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:09,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:02:09,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 0 proven. 905 refuted. 0 times theorem prover too weak. 1049 trivial. 0 not checked. [2019-09-07 11:02:10,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:10,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:10,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:02:10,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:02:10,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:10,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:02:10,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 1758 trivial. 0 not checked. [2019-09-07 11:02:10,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:10,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-09-07 11:02:10,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:02:10,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:02:10,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:02:10,475 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 31 states. [2019-09-07 11:02:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:10,594 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2019-09-07 11:02:10,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 11:02:10,595 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 162 [2019-09-07 11:02:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:10,596 INFO L225 Difference]: With dead ends: 173 [2019-09-07 11:02:10,596 INFO L226 Difference]: Without dead ends: 107 [2019-09-07 11:02:10,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:02:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-07 11:02:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-09-07 11:02:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-07 11:02:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-09-07 11:02:10,602 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 162 [2019-09-07 11:02:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:10,603 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-09-07 11:02:10,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 11:02:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-09-07 11:02:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-07 11:02:10,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:10,604 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 15, 15, 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-09-07 11:02:10,604 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:10,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:10,605 INFO L82 PathProgramCache]: Analyzing trace with hash 517832597, now seen corresponding path program 27 times [2019-09-07 11:02:10,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:10,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:10,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2019-09-07 11:02:10,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:10,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:10,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:02:11,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-07 11:02:11,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:11,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 11:02:11,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:02:11,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:11,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 11:02:11,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 11:02:11,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 11:02:11,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:02:11,457 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 16 states. [2019-09-07 11:02:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:11,506 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2019-09-07 11:02:11,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:02:11,506 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 170 [2019-09-07 11:02:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:11,508 INFO L225 Difference]: With dead ends: 147 [2019-09-07 11:02:11,508 INFO L226 Difference]: Without dead ends: 108 [2019-09-07 11:02:11,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:02:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-07 11:02:11,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-07 11:02:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-07 11:02:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-09-07 11:02:11,512 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 170 [2019-09-07 11:02:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:11,513 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-09-07 11:02:11,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 11:02:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-09-07 11:02:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-07 11:02:11,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:11,514 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 15, 15, 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-09-07 11:02:11,515 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:11,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:11,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1796291731, now seen corresponding path program 28 times [2019-09-07 11:02:11,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:11,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:11,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:11,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:11,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2257 backedges. 0 proven. 1044 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2019-09-07 11:02:11,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:11,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:11,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:02:11,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:02:11,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:11,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:02:11,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2257 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-09-07 11:02:12,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:12,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-09-07 11:02:12,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 11:02:12,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 11:02:12,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:02:12,062 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 33 states. [2019-09-07 11:02:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:12,167 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2019-09-07 11:02:12,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 11:02:12,168 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 172 [2019-09-07 11:02:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:12,169 INFO L225 Difference]: With dead ends: 183 [2019-09-07 11:02:12,169 INFO L226 Difference]: Without dead ends: 113 [2019-09-07 11:02:12,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:02:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-07 11:02:12,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-09-07 11:02:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-07 11:02:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-09-07 11:02:12,183 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 172 [2019-09-07 11:02:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:12,184 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-09-07 11:02:12,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 11:02:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-09-07 11:02:12,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-07 11:02:12,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:12,185 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 16, 16, 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-09-07 11:02:12,185 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:12,186 INFO L82 PathProgramCache]: Analyzing trace with hash -148282125, now seen corresponding path program 29 times [2019-09-07 11:02:12,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:12,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:12,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:12,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:12,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2555 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 2386 trivial. 0 not checked. [2019-09-07 11:02:12,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:12,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:02:12,399 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:24,121 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-09-07 11:02:24,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:24,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:02:24,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2555 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2019-09-07 11:02:24,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:24,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-09-07 11:02:24,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:02:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:02:24,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:02:24,430 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 32 states. [2019-09-07 11:02:24,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:24,568 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions. [2019-09-07 11:02:24,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:02:24,568 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 180 [2019-09-07 11:02:24,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:24,569 INFO L225 Difference]: With dead ends: 188 [2019-09-07 11:02:24,569 INFO L226 Difference]: Without dead ends: 117 [2019-09-07 11:02:24,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:02:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-07 11:02:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-09-07 11:02:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-07 11:02:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-09-07 11:02:24,579 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 180 [2019-09-07 11:02:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:24,579 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-09-07 11:02:24,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:02:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-09-07 11:02:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-07 11:02:24,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:24,582 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 16, 16, 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-09-07 11:02:24,582 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:24,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:24,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2116432751, now seen corresponding path program 30 times [2019-09-07 11:02:24,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:24,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:24,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:24,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:24,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2867 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-09-07 11:02:24,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:24,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:02:24,840 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:27,722 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-07 11:02:27,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:27,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:02:27,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2867 backedges. 1098 proven. 196 refuted. 0 times theorem prover too weak. 1573 trivial. 0 not checked. [2019-09-07 11:02:27,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:27,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 11:02:27,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 11:02:27,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 11:02:27,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:02:27,786 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 18 states. [2019-09-07 11:02:27,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:27,838 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2019-09-07 11:02:27,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 11:02:27,839 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 188 [2019-09-07 11:02:27,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:27,840 INFO L225 Difference]: With dead ends: 161 [2019-09-07 11:02:27,840 INFO L226 Difference]: Without dead ends: 118 [2019-09-07 11:02:27,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:02:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-07 11:02:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-07 11:02:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-07 11:02:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-09-07 11:02:27,852 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 188 [2019-09-07 11:02:27,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:27,853 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-09-07 11:02:27,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 11:02:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-09-07 11:02:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-07 11:02:27,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:27,855 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 16, 16, 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-09-07 11:02:27,855 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:27,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:27,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1400749587, now seen corresponding path program 31 times [2019-09-07 11:02:27,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:27,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:27,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:27,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:27,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-09-07 11:02:28,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:28,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:02:28,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:28,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 11:02:28,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-09-07 11:02:28,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:28,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 11:02:28,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:02:28,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:02:28,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:02:28,277 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 20 states. [2019-09-07 11:02:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:28,343 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2019-09-07 11:02:28,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:02:28,343 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 190 [2019-09-07 11:02:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:28,344 INFO L225 Difference]: With dead ends: 198 [2019-09-07 11:02:28,344 INFO L226 Difference]: Without dead ends: 120 [2019-09-07 11:02:28,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:02:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-07 11:02:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-07 11:02:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-07 11:02:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-09-07 11:02:28,350 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 190 [2019-09-07 11:02:28,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:28,351 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-09-07 11:02:28,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:02:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-09-07 11:02:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 11:02:28,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:28,352 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 17, 17, 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-09-07 11:02:28,353 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:28,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:28,353 INFO L82 PathProgramCache]: Analyzing trace with hash 938993359, now seen corresponding path program 32 times [2019-09-07 11:02:28,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:28,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:28,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:28,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:02:28,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 1577 trivial. 0 not checked. [2019-09-07 11:02:28,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:28,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:28,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:02:28,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:02:28,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:28,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 11:02:28,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:02:29,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:29,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2019-09-07 11:02:29,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 11:02:29,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 11:02:29,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:02:29,004 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 37 states. [2019-09-07 11:02:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:29,151 INFO L93 Difference]: Finished difference Result 203 states and 215 transitions. [2019-09-07 11:02:29,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 11:02:29,152 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 192 [2019-09-07 11:02:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:29,153 INFO L225 Difference]: With dead ends: 203 [2019-09-07 11:02:29,153 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 11:02:29,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:02:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 11:02:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-09-07 11:02:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-07 11:02:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-09-07 11:02:29,163 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 192 [2019-09-07 11:02:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:29,163 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-09-07 11:02:29,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 11:02:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-09-07 11:02:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-07 11:02:29,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:29,165 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 18, 18, 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-09-07 11:02:29,165 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:29,166 INFO L82 PathProgramCache]: Analyzing trace with hash -932009169, now seen corresponding path program 33 times [2019-09-07 11:02:29,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:29,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:29,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:29,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2019-09-07 11:02:29,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:29,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:02:29,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:32,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-07 11:02:32,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:32,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:02:32,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 1234 proven. 225 refuted. 0 times theorem prover too weak. 1808 trivial. 0 not checked. [2019-09-07 11:02:32,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:32,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 11:02:32,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:02:32,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:02:32,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:02:32,063 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 19 states. [2019-09-07 11:02:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:32,121 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2019-09-07 11:02:32,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 11:02:32,123 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 200 [2019-09-07 11:02:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:32,124 INFO L225 Difference]: With dead ends: 171 [2019-09-07 11:02:32,125 INFO L226 Difference]: Without dead ends: 126 [2019-09-07 11:02:32,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:02:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-07 11:02:32,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-07 11:02:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-07 11:02:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-09-07 11:02:32,130 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 200 [2019-09-07 11:02:32,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:32,130 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-09-07 11:02:32,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:02:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-09-07 11:02:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-07 11:02:32,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:32,132 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 18, 18, 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-09-07 11:02:32,132 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:32,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:32,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1922611629, now seen corresponding path program 34 times [2019-09-07 11:02:32,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:32,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:32,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:32,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:32,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3298 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2019-09-07 11:02:32,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:32,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:02:32,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:32,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:02:32,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:32,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:02:32,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3298 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-09-07 11:02:32,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:32,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2019-09-07 11:02:32,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 11:02:32,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 11:02:32,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 11:02:32,798 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 39 states. [2019-09-07 11:02:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:32,914 INFO L93 Difference]: Finished difference Result 213 states and 225 transitions. [2019-09-07 11:02:32,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 11:02:32,914 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 202 [2019-09-07 11:02:32,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:32,915 INFO L225 Difference]: With dead ends: 213 [2019-09-07 11:02:32,915 INFO L226 Difference]: Without dead ends: 131 [2019-09-07 11:02:32,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 11:02:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-07 11:02:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2019-09-07 11:02:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-07 11:02:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2019-09-07 11:02:32,923 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 202 [2019-09-07 11:02:32,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:32,924 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2019-09-07 11:02:32,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 11:02:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2019-09-07 11:02:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-07 11:02:32,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:32,926 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 19, 19, 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-09-07 11:02:32,926 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:32,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:32,926 INFO L82 PathProgramCache]: Analyzing trace with hash 304401421, now seen corresponding path program 35 times [2019-09-07 11:02:32,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:32,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:32,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:32,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:32,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3656 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 3400 trivial. 0 not checked. [2019-09-07 11:02:33,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:33,184 INFO L223 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) [2019-09-07 11:02:33,199 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:52,421 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-09-07 11:02:52,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:52,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:02:52,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3656 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 1960 trivial. 0 not checked. [2019-09-07 11:02:52,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:52,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2019-09-07 11:02:52,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 11:02:52,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 11:02:52,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:02:52,783 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 38 states. [2019-09-07 11:02:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:52,928 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2019-09-07 11:02:52,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 11:02:52,929 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 210 [2019-09-07 11:02:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:52,930 INFO L225 Difference]: With dead ends: 218 [2019-09-07 11:02:52,930 INFO L226 Difference]: Without dead ends: 135 [2019-09-07 11:02:52,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:02:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-07 11:02:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2019-09-07 11:02:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-07 11:02:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2019-09-07 11:02:52,937 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 210 [2019-09-07 11:02:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:52,937 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2019-09-07 11:02:52,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 11:02:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2019-09-07 11:02:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-07 11:02:52,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:52,939 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 19, 19, 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-09-07 11:02:52,939 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:52,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash 97586569, now seen corresponding path program 36 times [2019-09-07 11:02:52,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:52,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:52,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4028 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 3739 trivial. 0 not checked. [2019-09-07 11:02:53,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:53,253 INFO L223 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) [2019-09-07 11:02:53,273 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:55,973 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-07 11:02:55,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:55,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:02:55,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4028 backedges. 1530 proven. 289 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2019-09-07 11:02:56,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:56,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 11:02:56,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 11:02:56,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 11:02:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:02:56,040 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 21 states. [2019-09-07 11:02:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:56,102 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2019-09-07 11:02:56,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:02:56,103 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 218 [2019-09-07 11:02:56,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:56,104 INFO L225 Difference]: With dead ends: 185 [2019-09-07 11:02:56,104 INFO L226 Difference]: Without dead ends: 136 [2019-09-07 11:02:56,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:02:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-07 11:02:56,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-07 11:02:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-07 11:02:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-09-07 11:02:56,111 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 218 [2019-09-07 11:02:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:56,112 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-09-07 11:02:56,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 11:02:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-09-07 11:02:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-07 11:02:56,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:56,114 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 19, 19, 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-09-07 11:02:56,114 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:56,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:56,115 INFO L82 PathProgramCache]: Analyzing trace with hash -544879225, now seen corresponding path program 37 times [2019-09-07 11:02:56,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:56,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:56,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:56,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:56,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-09-07 11:02:56,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:56,419 INFO L223 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) [2019-09-07 11:02:56,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:56,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 11:02:56,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-09-07 11:02:56,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:56,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 11:02:56,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:02:56,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:02:56,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:02:56,611 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 23 states. [2019-09-07 11:02:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:56,686 INFO L93 Difference]: Finished difference Result 228 states and 236 transitions. [2019-09-07 11:02:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:02:56,687 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 220 [2019-09-07 11:02:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:56,688 INFO L225 Difference]: With dead ends: 228 [2019-09-07 11:02:56,688 INFO L226 Difference]: Without dead ends: 138 [2019-09-07 11:02:56,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:02:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-07 11:02:56,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-07 11:02:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-07 11:02:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2019-09-07 11:02:56,693 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 220 [2019-09-07 11:02:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:56,694 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2019-09-07 11:02:56,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:02:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2019-09-07 11:02:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-07 11:02:56,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:56,695 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 20, 20, 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-09-07 11:02:56,696 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1174747881, now seen corresponding path program 38 times [2019-09-07 11:02:56,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:56,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:56,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:56,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:02:56,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4102 backedges. 0 proven. 1889 refuted. 0 times theorem prover too weak. 2213 trivial. 0 not checked. [2019-09-07 11:02:57,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:57,000 INFO L223 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) [2019-09-07 11:02:57,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:02:57,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:02:57,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:02:57,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 11:02:57,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:02:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4102 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:02:57,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:02:57,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-07 11:02:57,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 11:02:57,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 11:02:57,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 11:02:57,669 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 43 states. [2019-09-07 11:02:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:02:57,836 INFO L93 Difference]: Finished difference Result 233 states and 245 transitions. [2019-09-07 11:02:57,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 11:02:57,837 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 222 [2019-09-07 11:02:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:02:57,838 INFO L225 Difference]: With dead ends: 233 [2019-09-07 11:02:57,838 INFO L226 Difference]: Without dead ends: 143 [2019-09-07 11:02:57,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 11:02:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-07 11:02:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-09-07 11:02:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-07 11:02:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2019-09-07 11:02:57,845 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 222 [2019-09-07 11:02:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:02:57,845 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2019-09-07 11:02:57,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 11:02:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2019-09-07 11:02:57,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-07 11:02:57,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:02:57,847 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 21, 21, 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-09-07 11:02:57,847 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:02:57,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:02:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash -839653047, now seen corresponding path program 39 times [2019-09-07 11:02:57,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:02:57,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:02:57,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:57,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:02:57,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:02:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:02:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4500 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 4176 trivial. 0 not checked. [2019-09-07 11:02:58,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:02:58,141 INFO L223 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-09-07 11:02:58,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:03:04,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-07 11:03:04,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:03:04,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:03:04,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:03:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4500 backedges. 1690 proven. 324 refuted. 0 times theorem prover too weak. 2486 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:03:04,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:03:04,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 11:03:04,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:03:04,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:03:04,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:03:04,497 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 22 states. [2019-09-07 11:03:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:03:04,564 INFO L93 Difference]: Finished difference Result 195 states and 200 transitions. [2019-09-07 11:03:04,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 11:03:04,565 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 230 [2019-09-07 11:03:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:03:04,567 INFO L225 Difference]: With dead ends: 195 [2019-09-07 11:03:04,567 INFO L226 Difference]: Without dead ends: 144 [2019-09-07 11:03:04,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:03:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-07 11:03:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-07 11:03:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-07 11:03:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2019-09-07 11:03:04,575 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 230 [2019-09-07 11:03:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:03:04,575 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2019-09-07 11:03:04,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:03:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2019-09-07 11:03:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-07 11:03:04,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:03:04,577 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 21, 21, 19, 19, 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-09-07 11:03:04,577 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:03:04,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:03:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash -118118073, now seen corresponding path program 40 times [2019-09-07 11:03:04,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:03:04,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:03:04,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:03:04,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:03:04,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:03:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:03:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4537 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 2449 trivial. 0 not checked. [2019-09-07 11:03:04,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:03:04,932 INFO L223 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) [2019-09-07 11:03:04,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:03:05,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:03:05,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:03:05,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:03:05,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:03:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4537 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 4096 trivial. 0 not checked. [2019-09-07 11:03:05,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:03:05,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2019-09-07 11:03:05,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 11:03:05,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 11:03:05,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 11:03:05,667 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 45 states. [2019-09-07 11:03:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:03:05,914 INFO L93 Difference]: Finished difference Result 243 states and 255 transitions. [2019-09-07 11:03:05,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 11:03:05,914 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 232 [2019-09-07 11:03:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:03:05,916 INFO L225 Difference]: With dead ends: 243 [2019-09-07 11:03:05,916 INFO L226 Difference]: Without dead ends: 149 [2019-09-07 11:03:05,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 11:03:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-07 11:03:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2019-09-07 11:03:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-07 11:03:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-09-07 11:03:05,926 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 232 [2019-09-07 11:03:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:03:05,926 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-09-07 11:03:05,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 11:03:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-09-07 11:03:05,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-07 11:03:05,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:03:05,929 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 22, 22, 19, 19, 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-09-07 11:03:05,930 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:03:05,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:03:05,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1221220953, now seen corresponding path program 41 times [2019-09-07 11:03:05,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:03:05,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:03:05,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:03:05,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:03:05,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:03:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:03:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4955 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 4594 trivial. 0 not checked. [2019-09-07 11:03:06,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:03:06,254 INFO L223 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) [2019-09-07 11:03:06,267 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:04:11,013 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2019-09-07 11:04:11,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:04:11,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:04:11,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:04:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4955 backedges. 1852 proven. 441 refuted. 0 times theorem prover too weak. 2662 trivial. 0 not checked. [2019-09-07 11:04:11,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:04:11,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2019-09-07 11:04:11,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 11:04:11,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 11:04:11,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 11:04:11,497 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 44 states. [2019-09-07 11:04:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:04:11,691 INFO L93 Difference]: Finished difference Result 248 states and 259 transitions. [2019-09-07 11:04:11,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 11:04:11,691 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 240 [2019-09-07 11:04:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:04:11,693 INFO L225 Difference]: With dead ends: 248 [2019-09-07 11:04:11,693 INFO L226 Difference]: Without dead ends: 153 [2019-09-07 11:04:11,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 11:04:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-07 11:04:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-09-07 11:04:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-07 11:04:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2019-09-07 11:04:11,700 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 240 [2019-09-07 11:04:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:04:11,701 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2019-09-07 11:04:11,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 11:04:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2019-09-07 11:04:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-07 11:04:11,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:04:11,703 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 22, 22, 20, 20, 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-09-07 11:04:11,703 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:04:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:04:11,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2017761827, now seen corresponding path program 42 times [2019-09-07 11:04:11,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:04:11,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:04:11,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:04:11,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:04:11,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:04:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:04:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5387 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 4987 trivial. 0 not checked. [2019-09-07 11:04:12,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:04:12,026 INFO L223 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) [2019-09-07 11:04:12,045 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:04:16,391 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-07 11:04:16,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:04:16,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 11:04:16,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:04:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5387 backedges. 2034 proven. 400 refuted. 0 times theorem prover too weak. 2953 trivial. 0 not checked. [2019-09-07 11:04:16,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:04:16,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 11:04:16,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 11:04:16,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 11:04:16,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 11:04:16,463 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 24 states. [2019-09-07 11:04:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:04:16,540 INFO L93 Difference]: Finished difference Result 209 states and 214 transitions. [2019-09-07 11:04:16,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 11:04:16,541 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 248 [2019-09-07 11:04:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:04:16,542 INFO L225 Difference]: With dead ends: 209 [2019-09-07 11:04:16,542 INFO L226 Difference]: Without dead ends: 154 [2019-09-07 11:04:16,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 11:04:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-07 11:04:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-07 11:04:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-07 11:04:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-09-07 11:04:16,547 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 248 [2019-09-07 11:04:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:04:16,548 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-09-07 11:04:16,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 11:04:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-09-07 11:04:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-07 11:04:16,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:04:16,549 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 22, 22, 21, 21, 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-09-07 11:04:16,550 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:04:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:04:16,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1771269025, now seen corresponding path program 43 times [2019-09-07 11:04:16,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:04:16,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:04:16,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:04:16,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:04:16,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:04:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:04:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5428 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 4944 trivial. 0 not checked. [2019-09-07 11:04:16,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:04:16,946 INFO L223 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) [2019-09-07 11:04:16,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:04:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:04:17,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 11:04:17,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:04:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5428 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 4944 trivial. 0 not checked. [2019-09-07 11:04:17,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:04:17,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 11:04:17,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:04:17,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:04:17,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:04:17,125 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 26 states. [2019-09-07 11:04:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:04:17,201 INFO L93 Difference]: Finished difference Result 258 states and 266 transitions. [2019-09-07 11:04:17,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 11:04:17,203 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 250 [2019-09-07 11:04:17,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:04:17,205 INFO L225 Difference]: With dead ends: 258 [2019-09-07 11:04:17,205 INFO L226 Difference]: Without dead ends: 156 [2019-09-07 11:04:17,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:04:17,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-07 11:04:17,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-07 11:04:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-07 11:04:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2019-09-07 11:04:17,222 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 250 [2019-09-07 11:04:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:04:17,222 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2019-09-07 11:04:17,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:04:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2019-09-07 11:04:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-07 11:04:17,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:04:17,224 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 23, 23, 21, 21, 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-09-07 11:04:17,224 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:04:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:04:17,225 INFO L82 PathProgramCache]: Analyzing trace with hash -969752189, now seen corresponding path program 44 times [2019-09-07 11:04:17,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:04:17,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:04:17,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:04:17,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:04:17,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:04:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:04:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5473 backedges. 0 proven. 2516 refuted. 0 times theorem prover too weak. 2957 trivial. 0 not checked. [2019-09-07 11:04:17,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:04:17,621 INFO L223 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) [2019-09-07 11:04:17,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:04:17,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:04:17,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:04:17,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 11:04:17,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:04:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5473 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 4944 trivial. 0 not checked. [2019-09-07 11:04:18,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:04:18,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2019-09-07 11:04:18,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 11:04:18,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 11:04:18,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:04:18,267 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 49 states. [2019-09-07 11:04:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:04:18,451 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2019-09-07 11:04:18,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 11:04:18,451 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 252 [2019-09-07 11:04:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:04:18,452 INFO L225 Difference]: With dead ends: 263 [2019-09-07 11:04:18,452 INFO L226 Difference]: Without dead ends: 161 [2019-09-07 11:04:18,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:04:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-07 11:04:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2019-09-07 11:04:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-07 11:04:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2019-09-07 11:04:18,461 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 252 [2019-09-07 11:04:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:04:18,461 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2019-09-07 11:04:18,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 11:04:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2019-09-07 11:04:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-07 11:04:18,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:04:18,463 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 24, 24, 21, 21, 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-09-07 11:04:18,463 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:04:18,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:04:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1781179933, now seen corresponding path program 45 times [2019-09-07 11:04:18,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:04:18,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:04:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:04:18,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:04:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:04:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:04:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5931 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 5490 trivial. 0 not checked. [2019-09-07 11:04:18,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:04:18,909 INFO L223 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) [2019-09-07 11:04:18,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:04:30,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-07 11:04:30,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:04:30,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 11:04:30,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:04:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5931 backedges. 2218 proven. 441 refuted. 0 times theorem prover too weak. 3272 trivial. 0 not checked. [2019-09-07 11:04:30,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:04:30,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 11:04:30,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:04:30,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:04:30,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:04:30,840 INFO L87 Difference]: Start difference. First operand 159 states and 163 transitions. Second operand 25 states. [2019-09-07 11:04:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:04:30,898 INFO L93 Difference]: Finished difference Result 219 states and 224 transitions. [2019-09-07 11:04:30,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 11:04:30,899 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 260 [2019-09-07 11:04:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:04:30,900 INFO L225 Difference]: With dead ends: 219 [2019-09-07 11:04:30,900 INFO L226 Difference]: Without dead ends: 162 [2019-09-07 11:04:30,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:04:30,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-07 11:04:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-07 11:04:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-07 11:04:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2019-09-07 11:04:30,907 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 260 [2019-09-07 11:04:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:04:30,907 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2019-09-07 11:04:30,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:04:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2019-09-07 11:04:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-07 11:04:30,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:04:30,909 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 24, 24, 22, 22, 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-09-07 11:04:30,910 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:04:30,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:04:30,910 INFO L82 PathProgramCache]: Analyzing trace with hash -854316191, now seen corresponding path program 46 times [2019-09-07 11:04:30,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:04:30,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:04:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:04:30,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:04:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:04:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:04:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5974 backedges. 0 proven. 2745 refuted. 0 times theorem prover too weak. 3229 trivial. 0 not checked. [2019-09-07 11:04:31,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:04:31,255 INFO L223 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-09-07 11:04:31,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:04:31,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:04:31,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:04:31,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 11:04:31,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:04:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5974 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 5398 trivial. 0 not checked. [2019-09-07 11:04:31,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:04:31,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2019-09-07 11:04:31,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 11:04:31,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 11:04:31,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 11:04:31,878 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 51 states. [2019-09-07 11:04:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:04:32,096 INFO L93 Difference]: Finished difference Result 273 states and 285 transitions. [2019-09-07 11:04:32,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 11:04:32,099 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 262 [2019-09-07 11:04:32,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:04:32,100 INFO L225 Difference]: With dead ends: 273 [2019-09-07 11:04:32,100 INFO L226 Difference]: Without dead ends: 167 [2019-09-07 11:04:32,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 11:04:32,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-07 11:04:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2019-09-07 11:04:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-07 11:04:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-09-07 11:04:32,106 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 262 [2019-09-07 11:04:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:04:32,106 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-09-07 11:04:32,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 11:04:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-09-07 11:04:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-07 11:04:32,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:04:32,108 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 25, 25, 22, 22, 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-09-07 11:04:32,109 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:04:32,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:04:32,109 INFO L82 PathProgramCache]: Analyzing trace with hash 885526977, now seen corresponding path program 47 times [2019-09-07 11:04:32,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:04:32,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:04:32,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:04:32,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:04:32,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:04:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:04:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6452 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 5968 trivial. 0 not checked. [2019-09-07 11:04:32,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:04:32,447 INFO L223 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-09-07 11:04:32,457 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:05:57,964 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2019-09-07 11:05:57,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:05:58,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 11:05:58,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:05:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6452 backedges. 2404 proven. 576 refuted. 0 times theorem prover too weak. 3472 trivial. 0 not checked. [2019-09-07 11:05:58,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:05:58,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 50 [2019-09-07 11:05:58,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 11:05:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 11:05:58,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=1800, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 11:05:58,599 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 50 states. [2019-09-07 11:05:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:05:58,804 INFO L93 Difference]: Finished difference Result 278 states and 289 transitions. [2019-09-07 11:05:58,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 11:05:58,810 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 270 [2019-09-07 11:05:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:05:58,811 INFO L225 Difference]: With dead ends: 278 [2019-09-07 11:05:58,811 INFO L226 Difference]: Without dead ends: 171 [2019-09-07 11:05:58,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=650, Invalid=1800, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 11:05:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-07 11:05:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-09-07 11:05:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-07 11:05:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 173 transitions. [2019-09-07 11:05:58,819 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 173 transitions. Word has length 270 [2019-09-07 11:05:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:05:58,821 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 173 transitions. [2019-09-07 11:05:58,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 11:05:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2019-09-07 11:05:58,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-07 11:05:58,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:05:58,826 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 25, 25, 23, 23, 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-09-07 11:05:58,826 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:05:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:05:58,827 INFO L82 PathProgramCache]: Analyzing trace with hash -849544899, now seen corresponding path program 48 times [2019-09-07 11:05:58,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:05:58,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:05:58,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:05:58,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:05:58,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:05:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:05:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6944 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 6415 trivial. 0 not checked. [2019-09-07 11:05:59,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:05:59,233 INFO L223 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-09-07 11:05:59,243 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:06:05,706 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-07 11:06:05,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:06:05,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:06:05,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:06:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6944 backedges. 2610 proven. 529 refuted. 0 times theorem prover too weak. 3805 trivial. 0 not checked. [2019-09-07 11:06:05,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:06:05,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 11:06:05,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 11:06:05,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 11:06:05,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:06:05,801 INFO L87 Difference]: Start difference. First operand 169 states and 173 transitions. Second operand 27 states. [2019-09-07 11:06:05,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:06:05,878 INFO L93 Difference]: Finished difference Result 233 states and 238 transitions. [2019-09-07 11:06:05,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 11:06:05,879 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 278 [2019-09-07 11:06:05,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:06:05,880 INFO L225 Difference]: With dead ends: 233 [2019-09-07 11:06:05,880 INFO L226 Difference]: Without dead ends: 172 [2019-09-07 11:06:05,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:06:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-07 11:06:05,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-07 11:06:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-07 11:06:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-09-07 11:06:05,891 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 278 [2019-09-07 11:06:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:06:05,891 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-09-07 11:06:05,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 11:06:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-09-07 11:06:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-07 11:06:05,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:06:05,893 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 25, 25, 24, 24, 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-09-07 11:06:05,893 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:06:05,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:06:05,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1895775291, now seen corresponding path program 49 times [2019-09-07 11:06:05,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:06:05,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:06:05,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:06:05,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:06:05,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:06:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:06:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6991 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 6366 trivial. 0 not checked. [2019-09-07 11:06:06,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:06:06,296 INFO L223 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-09-07 11:06:06,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:06:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:06:06,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 11:06:06,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:06:06,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6991 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 6366 trivial. 0 not checked. [2019-09-07 11:06:06,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:06:06,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 11:06:06,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 11:06:06,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 11:06:06,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:06:06,491 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 29 states. [2019-09-07 11:06:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:06:06,592 INFO L93 Difference]: Finished difference Result 288 states and 296 transitions. [2019-09-07 11:06:06,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 11:06:06,592 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 280 [2019-09-07 11:06:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:06:06,594 INFO L225 Difference]: With dead ends: 288 [2019-09-07 11:06:06,594 INFO L226 Difference]: Without dead ends: 174 [2019-09-07 11:06:06,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:06:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-07 11:06:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-07 11:06:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-07 11:06:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2019-09-07 11:06:06,602 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 280 [2019-09-07 11:06:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:06:06,603 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2019-09-07 11:06:06,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 11:06:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2019-09-07 11:06:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-07 11:06:06,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:06:06,606 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 26, 26, 24, 24, 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-09-07 11:06:06,606 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:06:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:06:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash -312698211, now seen corresponding path program 50 times [2019-09-07 11:06:06,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:06:06,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:06:06,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:06:06,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:06:06,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:06:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:06:07,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7042 backedges. 0 proven. 3233 refuted. 0 times theorem prover too weak. 3809 trivial. 0 not checked. [2019-09-07 11:06:07,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:06:07,303 INFO L223 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-09-07 11:06:07,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:06:07,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:06:07,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:06:07,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:06:07,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:06:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7042 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 6366 trivial. 0 not checked. [2019-09-07 11:06:08,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:06:08,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2019-09-07 11:06:08,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 11:06:08,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 11:06:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 11:06:08,139 INFO L87 Difference]: Start difference. First operand 173 states and 177 transitions. Second operand 55 states. [2019-09-07 11:06:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:06:08,341 INFO L93 Difference]: Finished difference Result 293 states and 305 transitions. [2019-09-07 11:06:08,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 11:06:08,344 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 282 [2019-09-07 11:06:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:06:08,345 INFO L225 Difference]: With dead ends: 293 [2019-09-07 11:06:08,346 INFO L226 Difference]: Without dead ends: 179 [2019-09-07 11:06:08,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 11:06:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-07 11:06:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-09-07 11:06:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-07 11:06:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-09-07 11:06:08,351 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 282 [2019-09-07 11:06:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:06:08,352 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-09-07 11:06:08,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 11:06:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-09-07 11:06:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-07 11:06:08,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:06:08,354 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 27, 27, 24, 24, 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-09-07 11:06:08,354 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:06:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:06:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash 879959293, now seen corresponding path program 51 times [2019-09-07 11:06:08,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:06:08,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:06:08,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:06:08,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:06:08,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:06:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:06:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7560 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 6984 trivial. 0 not checked. [2019-09-07 11:06:08,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:06:08,749 INFO L223 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) [2019-09-07 11:06:08,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:06:16,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-07 11:06:16,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:06:16,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 11:06:16,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:06:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7560 backedges. 2818 proven. 576 refuted. 0 times theorem prover too weak. 4166 trivial. 0 not checked. [2019-09-07 11:06:16,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:06:16,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 11:06:16,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:06:16,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:06:16,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:06:16,170 INFO L87 Difference]: Start difference. First operand 177 states and 181 transitions. Second operand 28 states. [2019-09-07 11:06:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:06:16,251 INFO L93 Difference]: Finished difference Result 243 states and 248 transitions. [2019-09-07 11:06:16,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 11:06:16,252 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 290 [2019-09-07 11:06:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:06:16,253 INFO L225 Difference]: With dead ends: 243 [2019-09-07 11:06:16,253 INFO L226 Difference]: Without dead ends: 180 [2019-09-07 11:06:16,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:06:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-07 11:06:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-07 11:06:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-07 11:06:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 183 transitions. [2019-09-07 11:06:16,258 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 183 transitions. Word has length 290 [2019-09-07 11:06:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:06:16,259 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 183 transitions. [2019-09-07 11:06:16,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:06:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2019-09-07 11:06:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-07 11:06:16,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:06:16,261 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 27, 27, 25, 25, 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-09-07 11:06:16,261 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:06:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:06:16,262 INFO L82 PathProgramCache]: Analyzing trace with hash -775397381, now seen corresponding path program 52 times [2019-09-07 11:06:16,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:06:16,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:06:16,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:06:16,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:06:16,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:06:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:06:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7609 backedges. 0 proven. 3492 refuted. 0 times theorem prover too weak. 4117 trivial. 0 not checked. [2019-09-07 11:06:16,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:06:16,675 INFO L223 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-09-07 11:06:16,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:06:16,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:06:16,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:06:16,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:06:16,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:06:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7609 backedges. 2816 proven. 676 refuted. 0 times theorem prover too weak. 4117 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (54)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:06:16,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:06:16,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 11:06:16,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 11:06:16,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 11:06:16,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:06:16,883 INFO L87 Difference]: Start difference. First operand 179 states and 183 transitions. Second operand 30 states. [2019-09-07 11:06:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:06:16,974 INFO L93 Difference]: Finished difference Result 299 states and 309 transitions. [2019-09-07 11:06:16,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 11:06:16,975 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 292 [2019-09-07 11:06:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:06:16,976 INFO L225 Difference]: With dead ends: 299 [2019-09-07 11:06:16,976 INFO L226 Difference]: Without dead ends: 182 [2019-09-07 11:06:16,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:06:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-07 11:06:16,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-07 11:06:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-07 11:06:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-09-07 11:06:16,982 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 292 [2019-09-07 11:06:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:06:16,983 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-09-07 11:06:16,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 11:06:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-09-07 11:06:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-07 11:06:16,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:06:16,985 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 27, 27, 25, 25, 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-09-07 11:06:16,985 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:06:16,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:06:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash 854910585, now seen corresponding path program 53 times [2019-09-07 11:06:16,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:06:16,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:06:16,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:06:16,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:06:16,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:06:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:06:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8092 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 7467 trivial. 0 not checked. [2019-09-07 11:06:17,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:06:17,420 INFO L223 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-09-07 11:06:17,432 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:08:22,283 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) [2019-09-07 11:08:22,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:08:22,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:08:22,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:08:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8092 backedges. 3028 proven. 729 refuted. 0 times theorem prover too weak. 4335 trivial. 0 not checked. [2019-09-07 11:08:22,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:08:22,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2019-09-07 11:08:22,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 11:08:22,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 11:08:22,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=2268, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 11:08:22,983 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 56 states. [2019-09-07 11:08:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:08:23,181 INFO L93 Difference]: Finished difference Result 306 states and 317 transitions. [2019-09-07 11:08:23,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 11:08:23,182 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 298 [2019-09-07 11:08:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:08:23,183 INFO L225 Difference]: With dead ends: 306 [2019-09-07 11:08:23,183 INFO L226 Difference]: Without dead ends: 187 [2019-09-07 11:08:23,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=812, Invalid=2268, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 11:08:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-07 11:08:23,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-09-07 11:08:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-07 11:08:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2019-09-07 11:08:23,190 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 298 [2019-09-07 11:08:23,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:08:23,190 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2019-09-07 11:08:23,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 11:08:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2019-09-07 11:08:23,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-07 11:08:23,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:08:23,192 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 27, 27, 26, 26, 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-09-07 11:08:23,193 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:08:23,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:08:23,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1838285557, now seen corresponding path program 54 times [2019-09-07 11:08:23,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:08:23,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:08:23,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:08:23,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:08:23,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:08:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:08:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8644 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 7915 trivial. 0 not checked. [2019-09-07 11:08:23,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:08:23,653 INFO L223 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-09-07 11:08:23,664 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:08:38,004 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-07 11:08:38,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:08:38,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 11:08:38,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:08:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8644 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 7915 trivial. 0 not checked. [2019-09-07 11:08:38,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:08:38,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 11:08:38,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:08:38,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:08:38,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:08:38,112 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 31 states. [2019-09-07 11:08:38,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:08:38,216 INFO L93 Difference]: Finished difference Result 312 states and 320 transitions. [2019-09-07 11:08:38,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 11:08:38,216 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 306 [2019-09-07 11:08:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:08:38,217 INFO L225 Difference]: With dead ends: 312 [2019-09-07 11:08:38,217 INFO L226 Difference]: Without dead ends: 188 [2019-09-07 11:08:38,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:08:38,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-07 11:08:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-07 11:08:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-07 11:08:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2019-09-07 11:08:38,223 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 306 [2019-09-07 11:08:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:08:38,223 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2019-09-07 11:08:38,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 11:08:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2019-09-07 11:08:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-07 11:08:38,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:08:38,225 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 28, 28, 26, 26, 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-09-07 11:08:38,225 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:08:38,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:08:38,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1260500265, now seen corresponding path program 55 times [2019-09-07 11:08:38,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:08:38,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:08:38,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:08:38,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:08:38,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:08:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:08:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8699 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 8023 trivial. 0 not checked. [2019-09-07 11:08:38,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:08:38,626 INFO L223 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-09-07 11:08:38,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:08:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:08:38,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 11:08:38,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:08:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8699 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 7915 trivial. 0 not checked. [2019-09-07 11:08:39,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:08:39,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2019-09-07 11:08:39,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 11:08:39,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 11:08:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2436, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 11:08:39,413 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 58 states. [2019-09-07 11:08:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:08:39,648 INFO L93 Difference]: Finished difference Result 317 states and 326 transitions. [2019-09-07 11:08:39,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 11:08:39,648 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 308 [2019-09-07 11:08:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:08:39,650 INFO L225 Difference]: With dead ends: 317 [2019-09-07 11:08:39,650 INFO L226 Difference]: Without dead ends: 193 [2019-09-07 11:08:39,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=870, Invalid=2436, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 11:08:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-07 11:08:39,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2019-09-07 11:08:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-07 11:08:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2019-09-07 11:08:39,657 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 308 [2019-09-07 11:08:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:08:39,657 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2019-09-07 11:08:39,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 11:08:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2019-09-07 11:08:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-07 11:08:39,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:08:39,659 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 29, 29, 27, 27, 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-09-07 11:08:39,660 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:08:39,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:08:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1883694647, now seen corresponding path program 56 times [2019-09-07 11:08:39,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:08:39,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:08:39,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:08:39,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:08:39,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:08:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:08:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8809 backedges. 0 proven. 4040 refuted. 0 times theorem prover too weak. 4769 trivial. 0 not checked. [2019-09-07 11:08:40,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:08:40,137 INFO L223 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-09-07 11:08:40,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:08:40,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:08:40,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:08:40,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 11:08:40,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:08:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8809 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 7968 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (58)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:08:40,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:08:40,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 61 [2019-09-07 11:08:40,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 11:08:40,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 11:08:40,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 11:08:40,997 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 61 states. [2019-09-07 11:08:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:08:41,239 INFO L93 Difference]: Finished difference Result 323 states and 335 transitions. [2019-09-07 11:08:41,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 11:08:41,239 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 312 [2019-09-07 11:08:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:08:41,242 INFO L225 Difference]: With dead ends: 323 [2019-09-07 11:08:41,242 INFO L226 Difference]: Without dead ends: 197 [2019-09-07 11:08:41,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 11:08:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-07 11:08:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-09-07 11:08:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-07 11:08:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2019-09-07 11:08:41,256 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 312 [2019-09-07 11:08:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:08:41,256 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2019-09-07 11:08:41,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 11:08:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2019-09-07 11:08:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-07 11:08:41,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:08:41,272 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 30, 30, 27, 27, 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-09-07 11:08:41,272 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:08:41,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:08:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash -837725545, now seen corresponding path program 57 times [2019-09-07 11:08:41,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:08:41,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:08:41,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:08:41,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:08:41,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:08:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:08:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9387 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 8658 trivial. 0 not checked. [2019-09-07 11:08:41,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:08:41,757 INFO L223 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-09-07 11:08:41,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:09:16,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-07 11:09:16,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:16,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-07 11:09:16,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9387 backedges. 3549 proven. 729 refuted. 0 times theorem prover too weak. 5109 trivial. 0 not checked. [2019-09-07 11:09:16,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:16,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 33 [2019-09-07 11:09:16,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 11:09:16,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 11:09:16,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:09:16,610 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 33 states. [2019-09-07 11:09:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:17,290 INFO L93 Difference]: Finished difference Result 267 states and 272 transitions. [2019-09-07 11:09:17,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:09:17,291 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 320 [2019-09-07 11:09:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:17,292 INFO L225 Difference]: With dead ends: 267 [2019-09-07 11:09:17,292 INFO L226 Difference]: Without dead ends: 198 [2019-09-07 11:09:17,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1339, Invalid=2321, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 11:09:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-07 11:09:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-07 11:09:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-07 11:09:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2019-09-07 11:09:17,298 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 320 [2019-09-07 11:09:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:17,299 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2019-09-07 11:09:17,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 11:09:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2019-09-07 11:09:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-07 11:09:17,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:17,302 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 30, 30, 28, 28, 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-09-07 11:09:17,302 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:17,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash -540121323, now seen corresponding path program 58 times [2019-09-07 11:09:17,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:17,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:17,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9442 backedges. 0 proven. 4329 refuted. 0 times theorem prover too weak. 5113 trivial. 0 not checked. [2019-09-07 11:09:17,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:17,814 INFO L223 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-09-07 11:09:17,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:09:17,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:09:17,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:09:17,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 11:09:17,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:09:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9442 backedges. 3488 proven. 841 refuted. 0 times theorem prover too weak. 5113 trivial. 0 not checked. [2019-09-07 11:09:18,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:09:18,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 11:09:18,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 11:09:18,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 11:09:18,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:09:18,050 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand 33 states. [2019-09-07 11:09:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:09:18,160 INFO L93 Difference]: Finished difference Result 329 states and 339 transitions. [2019-09-07 11:09:18,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:09:18,161 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 322 [2019-09-07 11:09:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:09:18,162 INFO L225 Difference]: With dead ends: 329 [2019-09-07 11:09:18,162 INFO L226 Difference]: Without dead ends: 200 [2019-09-07 11:09:18,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:09:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-07 11:09:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-07 11:09:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-07 11:09:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2019-09-07 11:09:18,169 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 322 [2019-09-07 11:09:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:09:18,169 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2019-09-07 11:09:18,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 11:09:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2019-09-07 11:09:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-07 11:09:18,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:09:18,171 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 30, 30, 28, 28, 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-09-07 11:09:18,171 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:09:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:09:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1091817235, now seen corresponding path program 59 times [2019-09-07 11:09:18,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:09:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:09:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:18,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:09:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:09:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:09:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9979 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 9195 trivial. 0 not checked. [2019-09-07 11:09:18,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:09:18,641 INFO L223 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-09-07 11:09:18,651 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:12:04,625 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2019-09-07 11:12:04,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:12:04,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 11:12:04,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:12:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9979 backedges. 3724 proven. 900 refuted. 0 times theorem prover too weak. 5355 trivial. 0 not checked. [2019-09-07 11:12:05,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:12:05,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 62 [2019-09-07 11:12:05,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 11:12:05,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 11:12:05,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=2790, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 11:12:05,405 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 62 states. [2019-09-07 11:12:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:12:05,668 INFO L93 Difference]: Finished difference Result 336 states and 347 transitions. [2019-09-07 11:12:05,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 11:12:05,669 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 328 [2019-09-07 11:12:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:12:05,670 INFO L225 Difference]: With dead ends: 336 [2019-09-07 11:12:05,670 INFO L226 Difference]: Without dead ends: 205 [2019-09-07 11:12:05,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=992, Invalid=2790, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 11:12:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-07 11:12:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2019-09-07 11:12:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-07 11:12:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 207 transitions. [2019-09-07 11:12:05,676 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 207 transitions. Word has length 328 [2019-09-07 11:12:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:12:05,676 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 207 transitions. [2019-09-07 11:12:05,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 11:12:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2019-09-07 11:12:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-07 11:12:05,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:12:05,679 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 30, 30, 29, 29, 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-09-07 11:12:05,679 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:12:05,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:12:05,680 INFO L82 PathProgramCache]: Analyzing trace with hash -115482993, now seen corresponding path program 60 times [2019-09-07 11:12:05,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:12:05,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:12:05,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:05,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:12:05,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10591 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 9691 trivial. 0 not checked. [2019-09-07 11:12:06,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:12:06,283 INFO L223 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-09-07 11:12:06,295 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:12:24,701 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-07 11:12:24,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:12:24,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:12:24,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:12:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10591 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 9691 trivial. 0 not checked. [2019-09-07 11:12:24,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:12:24,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 11:12:24,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 11:12:24,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 11:12:24,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 11:12:24,775 INFO L87 Difference]: Start difference. First operand 203 states and 207 transitions. Second operand 34 states. [2019-09-07 11:12:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:12:24,890 INFO L93 Difference]: Finished difference Result 342 states and 350 transitions. [2019-09-07 11:12:24,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 11:12:24,890 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 336 [2019-09-07 11:12:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:12:24,891 INFO L225 Difference]: With dead ends: 342 [2019-09-07 11:12:24,891 INFO L226 Difference]: Without dead ends: 206 [2019-09-07 11:12:24,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 11:12:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-07 11:12:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-07 11:12:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-07 11:12:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2019-09-07 11:12:24,898 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 336 [2019-09-07 11:12:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:12:24,898 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2019-09-07 11:12:24,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 11:12:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2019-09-07 11:12:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-07 11:12:24,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:12:24,900 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 31, 31, 29, 29, 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-09-07 11:12:24,901 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:12:24,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:12:24,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2020912881, now seen corresponding path program 61 times [2019-09-07 11:12:24,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:12:24,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:12:24,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:24,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:12:24,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10652 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 9811 trivial. 0 not checked. [2019-09-07 11:12:25,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:12:25,532 INFO L223 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) [2019-09-07 11:12:25,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:12:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:25,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 11:12:25,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:12:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10652 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 9691 trivial. 0 not checked. [2019-09-07 11:12:26,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:12:26,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 64 [2019-09-07 11:12:26,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-07 11:12:26,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-07 11:12:26,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 11:12:26,451 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 64 states. [2019-09-07 11:12:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:12:26,726 INFO L93 Difference]: Finished difference Result 347 states and 356 transitions. [2019-09-07 11:12:26,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 11:12:26,727 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 338 [2019-09-07 11:12:26,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:12:26,728 INFO L225 Difference]: With dead ends: 347 [2019-09-07 11:12:26,728 INFO L226 Difference]: Without dead ends: 211 [2019-09-07 11:12:26,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 11:12:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-07 11:12:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-09-07 11:12:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-07 11:12:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 213 transitions. [2019-09-07 11:12:26,735 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 213 transitions. Word has length 338 [2019-09-07 11:12:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:12:26,736 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 213 transitions. [2019-09-07 11:12:26,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-07 11:12:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 213 transitions. [2019-09-07 11:12:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-07 11:12:26,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:12:26,739 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 32, 32, 30, 30, 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-09-07 11:12:26,739 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:12:26,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:12:26,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1704838225, now seen corresponding path program 62 times [2019-09-07 11:12:26,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:12:26,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:12:26,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:26,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:12:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10774 backedges. 0 proven. 4937 refuted. 0 times theorem prover too weak. 5837 trivial. 0 not checked. [2019-09-07 11:12:27,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:12:27,230 INFO L223 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-09-07 11:12:27,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:12:27,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:12:27,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:12:27,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:12:27,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:12:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10774 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 9750 trivial. 0 not checked. [2019-09-07 11:12:28,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:12:28,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 67 [2019-09-07 11:12:28,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 11:12:28,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 11:12:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 11:12:28,196 INFO L87 Difference]: Start difference. First operand 209 states and 213 transitions. Second operand 67 states. [2019-09-07 11:12:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:12:28,439 INFO L93 Difference]: Finished difference Result 353 states and 365 transitions. [2019-09-07 11:12:28,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 11:12:28,439 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 342 [2019-09-07 11:12:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:12:28,440 INFO L225 Difference]: With dead ends: 353 [2019-09-07 11:12:28,440 INFO L226 Difference]: Without dead ends: 215 [2019-09-07 11:12:28,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 11:12:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-07 11:12:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-09-07 11:12:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-07 11:12:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2019-09-07 11:12:28,446 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 342 [2019-09-07 11:12:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:12:28,447 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2019-09-07 11:12:28,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 11:12:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2019-09-07 11:12:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-07 11:12:28,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:12:28,449 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 33, 33, 30, 30, 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-09-07 11:12:28,449 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:12:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:12:28,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2027690673, now seen corresponding path program 63 times [2019-09-07 11:12:28,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:12:28,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:12:28,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:28,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:12:28,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11412 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2019-09-07 11:12:29,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:12:29,010 INFO L223 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-09-07 11:12:29,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:12:46,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-07 11:12:46,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:12:46,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 11:12:46,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:12:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 11412 backedges. 4299 proven. 900 refuted. 0 times theorem prover too weak. 6213 trivial. 0 not checked. [2019-09-07 11:12:46,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:12:46,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 36 [2019-09-07 11:12:46,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 11:12:46,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 11:12:46,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:12:46,288 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 36 states. [2019-09-07 11:12:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:12:46,958 INFO L93 Difference]: Finished difference Result 291 states and 296 transitions. [2019-09-07 11:12:46,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 11:12:46,958 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 350 [2019-09-07 11:12:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:12:46,960 INFO L225 Difference]: With dead ends: 291 [2019-09-07 11:12:46,960 INFO L226 Difference]: Without dead ends: 216 [2019-09-07 11:12:46,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1621, Invalid=2801, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 11:12:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-07 11:12:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-09-07 11:12:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-07 11:12:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2019-09-07 11:12:46,966 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 350 [2019-09-07 11:12:46,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:12:46,966 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2019-09-07 11:12:46,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 11:12:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2019-09-07 11:12:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-07 11:12:46,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:12:46,969 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 33, 33, 31, 31, 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-09-07 11:12:46,969 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:12:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:12:46,969 INFO L82 PathProgramCache]: Analyzing trace with hash 667574447, now seen corresponding path program 64 times [2019-09-07 11:12:46,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:12:46,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:12:46,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:46,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:12:46,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11473 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 6217 trivial. 0 not checked. [2019-09-07 11:12:47,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:12:47,491 INFO L223 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-09-07 11:12:47,502 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:12:47,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:12:47,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:12:47,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 11:12:47,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:12:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11473 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 10384 trivial. 0 not checked. [2019-09-07 11:12:48,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:12:48,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 69 [2019-09-07 11:12:48,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 11:12:48,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 11:12:48,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 11:12:48,508 INFO L87 Difference]: Start difference. First operand 215 states and 219 transitions. Second operand 69 states. [2019-09-07 11:12:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:12:48,735 INFO L93 Difference]: Finished difference Result 363 states and 375 transitions. [2019-09-07 11:12:48,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 11:12:48,736 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 352 [2019-09-07 11:12:48,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:12:48,737 INFO L225 Difference]: With dead ends: 363 [2019-09-07 11:12:48,737 INFO L226 Difference]: Without dead ends: 221 [2019-09-07 11:12:48,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 11:12:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-07 11:12:48,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2019-09-07 11:12:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-07 11:12:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2019-09-07 11:12:48,741 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 352 [2019-09-07 11:12:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:12:48,741 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2019-09-07 11:12:48,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 11:12:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2019-09-07 11:12:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-07 11:12:48,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:12:48,743 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 34, 34, 31, 31, 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-09-07 11:12:48,743 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:12:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:12:48,743 INFO L82 PathProgramCache]: Analyzing trace with hash 928646415, now seen corresponding path program 65 times [2019-09-07 11:12:48,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:12:48,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:12:48,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:48,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:12:48,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12131 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 11170 trivial. 0 not checked. [2019-09-07 11:12:49,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:12:49,243 INFO L223 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-09-07 11:12:49,252 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:15:48,725 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 68 check-sat command(s) [2019-09-07 11:15:48,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:15:48,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 11:15:48,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12131 backedges. 4492 proven. 1089 refuted. 0 times theorem prover too weak. 6550 trivial. 0 not checked. [2019-09-07 11:15:49,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:49,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 68 [2019-09-07 11:15:49,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-07 11:15:49,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-07 11:15:49,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1190, Invalid=3366, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 11:15:49,673 INFO L87 Difference]: Start difference. First operand 219 states and 223 transitions. Second operand 68 states. [2019-09-07 11:15:49,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:49,915 INFO L93 Difference]: Finished difference Result 368 states and 379 transitions. [2019-09-07 11:15:49,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-07 11:15:49,916 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 360 [2019-09-07 11:15:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:49,917 INFO L225 Difference]: With dead ends: 368 [2019-09-07 11:15:49,917 INFO L226 Difference]: Without dead ends: 225 [2019-09-07 11:15:49,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1190, Invalid=3366, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 11:15:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-07 11:15:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2019-09-07 11:15:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-07 11:15:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 227 transitions. [2019-09-07 11:15:49,923 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 227 transitions. Word has length 360 [2019-09-07 11:15:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:49,924 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 227 transitions. [2019-09-07 11:15:49,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-07 11:15:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2019-09-07 11:15:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-07 11:15:49,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:49,926 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 34, 34, 32, 32, 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-09-07 11:15:49,927 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1572095371, now seen corresponding path program 66 times [2019-09-07 11:15:49,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:49,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:49,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:15:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12803 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 11779 trivial. 0 not checked. [2019-09-07 11:15:50,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:50,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:15:50,513 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE