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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:55:23,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:55:23,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:55:24,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:55:24,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:55:24,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:55:24,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:55:24,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:55:24,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:55:24,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:55:24,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:55:24,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:55:24,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:55:24,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:55:24,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:55:24,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:55:24,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:55:24,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:55:24,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:55:24,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:55:24,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:55:24,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:55:24,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:55:24,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:55:24,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:55:24,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:55:24,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:55:24,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:55:24,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:55:24,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:55:24,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:55:24,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:55:24,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:55:24,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:55:24,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:55:24,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:55:24,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:55:24,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:55:24,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:55:24,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:55:24,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:55:24,066 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-08 10:55:24,080 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:55:24,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:55:24,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:55:24,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:55:24,083 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:55:24,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:55:24,083 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:55:24,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:55:24,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:55:24,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:55:24,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:55:24,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:55:24,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:55:24,084 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:55:24,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:55:24,085 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:55:24,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:55:24,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:55:24,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:55:24,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:55:24,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:55:24,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:55:24,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:55:24,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:55:24,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:55:24,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:55:24,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:55:24,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:55:24,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:55:24,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:55:24,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:55:24,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:55:24,135 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:55:24,136 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:55:24,136 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 10:55:24,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717ccc89f/61b3fc7fbb1a4e248f7763f18feadb72/FLAGc286167f2 [2019-09-08 10:55:24,637 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:55:24,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 10:55:24,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717ccc89f/61b3fc7fbb1a4e248f7763f18feadb72/FLAGc286167f2 [2019-09-08 10:55:24,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717ccc89f/61b3fc7fbb1a4e248f7763f18feadb72 [2019-09-08 10:55:24,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:55:24,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:55:24,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:55:24,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:55:24,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:55:24,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:55:24" (1/1) ... [2019-09-08 10:55:24,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebd4b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:55:24, skipping insertion in model container [2019-09-08 10:55:25,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:55:24" (1/1) ... [2019-09-08 10:55:25,007 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:55:25,059 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:55:25,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:55:25,509 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:55:25,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:55:25,615 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:55:25,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:55:25 WrapperNode [2019-09-08 10:55:25,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:55:25,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:55:25,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:55:25,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:55:25,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:55:25" (1/1) ... [2019-09-08 10:55:25,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:55:25" (1/1) ... [2019-09-08 10:55:25,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:55:25" (1/1) ... [2019-09-08 10:55:25,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:55:25" (1/1) ... [2019-09-08 10:55:25,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:55:25" (1/1) ... [2019-09-08 10:55:25,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:55:25" (1/1) ... [2019-09-08 10:55:25,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:55:25" (1/1) ... [2019-09-08 10:55:25,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:55:25,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:55:25,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:55:25,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:55:25,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:55:25" (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-08 10:55:25,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:55:25,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:55:25,741 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:55:25,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:55:25,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:55:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:55:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:55:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:55:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:55:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:55:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:55:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:55:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:55:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:55:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:55:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:55:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:55:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:55:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:55:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:55:26,411 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:55:26,412 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:55:26,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:55:26 BoogieIcfgContainer [2019-09-08 10:55:26,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:55:26,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:55:26,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:55:26,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:55:26,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:55:24" (1/3) ... [2019-09-08 10:55:26,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee49cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:55:26, skipping insertion in model container [2019-09-08 10:55:26,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:55:25" (2/3) ... [2019-09-08 10:55:26,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee49cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:55:26, skipping insertion in model container [2019-09-08 10:55:26,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:55:26" (3/3) ... [2019-09-08 10:55:26,428 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 10:55:26,438 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:55:26,462 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:55:26,481 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:55:26,535 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:55:26,536 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:55:26,536 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:55:26,536 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:55:26,536 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:55:26,537 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:55:26,537 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:55:26,537 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:55:26,537 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:55:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-09-08 10:55:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 10:55:26,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:26,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:26,573 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:26,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:26,578 INFO L82 PathProgramCache]: Analyzing trace with hash 66205719, now seen corresponding path program 1 times [2019-09-08 10:55:26,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:26,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:26,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:26,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:26,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:27,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:27,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:55:27,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:55:27,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:55:27,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:55:27,049 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2019-09-08 10:55:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:27,175 INFO L93 Difference]: Finished difference Result 273 states and 432 transitions. [2019-09-08 10:55:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:55:27,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-08 10:55:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:27,194 INFO L225 Difference]: With dead ends: 273 [2019-09-08 10:55:27,195 INFO L226 Difference]: Without dead ends: 179 [2019-09-08 10:55:27,199 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-08 10:55:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-08 10:55:27,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-09-08 10:55:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-08 10:55:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2019-09-08 10:55:27,283 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 53 [2019-09-08 10:55:27,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:27,285 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2019-09-08 10:55:27,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:55:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2019-09-08 10:55:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:55:27,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:27,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:27,289 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:27,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:27,290 INFO L82 PathProgramCache]: Analyzing trace with hash -160431346, now seen corresponding path program 1 times [2019-09-08 10:55:27,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:27,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:27,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:27,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:27,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:27,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:27,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:55:27,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:55:27,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:55:27,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:55:27,492 INFO L87 Difference]: Start difference. First operand 177 states and 263 transitions. Second operand 3 states. [2019-09-08 10:55:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:27,575 INFO L93 Difference]: Finished difference Result 437 states and 675 transitions. [2019-09-08 10:55:27,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:55:27,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-08 10:55:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:27,581 INFO L225 Difference]: With dead ends: 437 [2019-09-08 10:55:27,581 INFO L226 Difference]: Without dead ends: 291 [2019-09-08 10:55:27,583 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-08 10:55:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-08 10:55:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2019-09-08 10:55:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-08 10:55:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 440 transitions. [2019-09-08 10:55:27,616 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 440 transitions. Word has length 54 [2019-09-08 10:55:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:27,617 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 440 transitions. [2019-09-08 10:55:27,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:55:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 440 transitions. [2019-09-08 10:55:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:55:27,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:27,619 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:27,619 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:27,620 INFO L82 PathProgramCache]: Analyzing trace with hash 783075062, now seen corresponding path program 1 times [2019-09-08 10:55:27,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:27,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:27,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:27,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:27,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:27,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:27,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:55:27,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:55:27,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:55:27,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:55:27,731 INFO L87 Difference]: Start difference. First operand 289 states and 440 transitions. Second operand 3 states. [2019-09-08 10:55:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:27,785 INFO L93 Difference]: Finished difference Result 741 states and 1154 transitions. [2019-09-08 10:55:27,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:55:27,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-08 10:55:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:27,790 INFO L225 Difference]: With dead ends: 741 [2019-09-08 10:55:27,790 INFO L226 Difference]: Without dead ends: 483 [2019-09-08 10:55:27,792 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-08 10:55:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-08 10:55:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2019-09-08 10:55:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-08 10:55:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 740 transitions. [2019-09-08 10:55:27,835 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 740 transitions. Word has length 55 [2019-09-08 10:55:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:27,835 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 740 transitions. [2019-09-08 10:55:27,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:55:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 740 transitions. [2019-09-08 10:55:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:55:27,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:27,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:27,838 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:27,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:27,838 INFO L82 PathProgramCache]: Analyzing trace with hash -842625673, now seen corresponding path program 1 times [2019-09-08 10:55:27,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:27,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:27,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:27,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:27,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:27,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:27,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:55:27,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:55:27,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:55:27,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:55:27,956 INFO L87 Difference]: Start difference. First operand 481 states and 740 transitions. Second operand 6 states. [2019-09-08 10:55:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:28,221 INFO L93 Difference]: Finished difference Result 2731 states and 4285 transitions. [2019-09-08 10:55:28,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:55:28,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:55:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:28,235 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 10:55:28,236 INFO L226 Difference]: Without dead ends: 2281 [2019-09-08 10:55:28,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:55:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2019-09-08 10:55:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 929. [2019-09-08 10:55:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-08 10:55:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1432 transitions. [2019-09-08 10:55:28,337 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1432 transitions. Word has length 56 [2019-09-08 10:55:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:28,338 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1432 transitions. [2019-09-08 10:55:28,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:55:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1432 transitions. [2019-09-08 10:55:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:55:28,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:28,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:28,341 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash -370124845, now seen corresponding path program 1 times [2019-09-08 10:55:28,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:28,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:28,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:28,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:28,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:28,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:28,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:55:28,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:55:28,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:55:28,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:55:28,544 INFO L87 Difference]: Start difference. First operand 929 states and 1432 transitions. Second operand 6 states. [2019-09-08 10:55:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:28,835 INFO L93 Difference]: Finished difference Result 4033 states and 6236 transitions. [2019-09-08 10:55:28,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:55:28,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-08 10:55:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:28,854 INFO L225 Difference]: With dead ends: 4033 [2019-09-08 10:55:28,855 INFO L226 Difference]: Without dead ends: 3135 [2019-09-08 10:55:28,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:55:28,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2019-09-08 10:55:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 3129. [2019-09-08 10:55:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2019-09-08 10:55:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4816 transitions. [2019-09-08 10:55:29,196 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4816 transitions. Word has length 57 [2019-09-08 10:55:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:29,197 INFO L475 AbstractCegarLoop]: Abstraction has 3129 states and 4816 transitions. [2019-09-08 10:55:29,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:55:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4816 transitions. [2019-09-08 10:55:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:55:29,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:29,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:29,204 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:29,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1007315784, now seen corresponding path program 1 times [2019-09-08 10:55:29,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:29,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:29,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:29,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:29,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:29,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:29,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:55:29,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:55:29,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:55:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:55:29,283 INFO L87 Difference]: Start difference. First operand 3129 states and 4816 transitions. Second operand 3 states. [2019-09-08 10:55:29,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:29,605 INFO L93 Difference]: Finished difference Result 8253 states and 12658 transitions. [2019-09-08 10:55:29,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:55:29,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-08 10:55:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:29,639 INFO L225 Difference]: With dead ends: 8253 [2019-09-08 10:55:29,640 INFO L226 Difference]: Without dead ends: 5155 [2019-09-08 10:55:29,652 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-08 10:55:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2019-09-08 10:55:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 5153. [2019-09-08 10:55:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2019-09-08 10:55:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 7808 transitions. [2019-09-08 10:55:30,195 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 7808 transitions. Word has length 58 [2019-09-08 10:55:30,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:30,197 INFO L475 AbstractCegarLoop]: Abstraction has 5153 states and 7808 transitions. [2019-09-08 10:55:30,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:55:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 7808 transitions. [2019-09-08 10:55:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:55:30,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:30,201 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:30,201 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:30,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1404763850, now seen corresponding path program 1 times [2019-09-08 10:55:30,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:30,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:30,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:30,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:30,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:30,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:30,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:55:30,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:55:30,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:55:30,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:55:30,285 INFO L87 Difference]: Start difference. First operand 5153 states and 7808 transitions. Second operand 5 states. [2019-09-08 10:55:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:31,066 INFO L93 Difference]: Finished difference Result 14261 states and 21650 transitions. [2019-09-08 10:55:31,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:55:31,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 10:55:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:31,116 INFO L225 Difference]: With dead ends: 14261 [2019-09-08 10:55:31,116 INFO L226 Difference]: Without dead ends: 9139 [2019-09-08 10:55:31,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:55:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9139 states. [2019-09-08 10:55:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9139 to 9137. [2019-09-08 10:55:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9137 states. [2019-09-08 10:55:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9137 states to 9137 states and 13760 transitions. [2019-09-08 10:55:31,845 INFO L78 Accepts]: Start accepts. Automaton has 9137 states and 13760 transitions. Word has length 59 [2019-09-08 10:55:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:31,847 INFO L475 AbstractCegarLoop]: Abstraction has 9137 states and 13760 transitions. [2019-09-08 10:55:31,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:55:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 9137 states and 13760 transitions. [2019-09-08 10:55:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:55:31,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:31,849 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:31,849 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:31,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:31,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1120231739, now seen corresponding path program 1 times [2019-09-08 10:55:31,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:31,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:31,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:31,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:31,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:31,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:31,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:55:31,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:55:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:55:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:55:31,950 INFO L87 Difference]: Start difference. First operand 9137 states and 13760 transitions. Second operand 5 states. [2019-09-08 10:55:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:33,140 INFO L93 Difference]: Finished difference Result 18691 states and 27937 transitions. [2019-09-08 10:55:33,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:55:33,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 10:55:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:33,214 INFO L225 Difference]: With dead ends: 18691 [2019-09-08 10:55:33,215 INFO L226 Difference]: Without dead ends: 18689 [2019-09-08 10:55:33,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:55:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18689 states. [2019-09-08 10:55:34,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18689 to 9585. [2019-09-08 10:55:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9585 states. [2019-09-08 10:55:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9585 states to 9585 states and 14208 transitions. [2019-09-08 10:55:34,395 INFO L78 Accepts]: Start accepts. Automaton has 9585 states and 14208 transitions. Word has length 59 [2019-09-08 10:55:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:34,395 INFO L475 AbstractCegarLoop]: Abstraction has 9585 states and 14208 transitions. [2019-09-08 10:55:34,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:55:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 9585 states and 14208 transitions. [2019-09-08 10:55:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:55:34,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:34,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:34,397 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:34,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:34,397 INFO L82 PathProgramCache]: Analyzing trace with hash -357825804, now seen corresponding path program 1 times [2019-09-08 10:55:34,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:34,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:34,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:34,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:34,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:34,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:34,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:55:34,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:55:34,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:55:34,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:55:34,480 INFO L87 Difference]: Start difference. First operand 9585 states and 14208 transitions. Second operand 3 states. [2019-09-08 10:55:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:35,117 INFO L93 Difference]: Finished difference Result 21615 states and 31976 transitions. [2019-09-08 10:55:35,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:55:35,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:55:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:35,145 INFO L225 Difference]: With dead ends: 21615 [2019-09-08 10:55:35,146 INFO L226 Difference]: Without dead ends: 12061 [2019-09-08 10:55:35,166 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-08 10:55:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12061 states. [2019-09-08 10:55:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12061 to 12003. [2019-09-08 10:55:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12003 states. [2019-09-08 10:55:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12003 states to 12003 states and 17630 transitions. [2019-09-08 10:55:35,857 INFO L78 Accepts]: Start accepts. Automaton has 12003 states and 17630 transitions. Word has length 60 [2019-09-08 10:55:35,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:35,857 INFO L475 AbstractCegarLoop]: Abstraction has 12003 states and 17630 transitions. [2019-09-08 10:55:35,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:55:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 12003 states and 17630 transitions. [2019-09-08 10:55:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:55:35,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:35,864 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:35,864 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:35,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:35,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1589729241, now seen corresponding path program 1 times [2019-09-08 10:55:35,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:35,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:35,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:35,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:35,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:36,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:55:36,096 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-08 10:55:36,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:36,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 10:55:36,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:55:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 10:55:36,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:55:36,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2019-09-08 10:55:36,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:55:36,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:55:36,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:55:36,434 INFO L87 Difference]: Start difference. First operand 12003 states and 17630 transitions. Second operand 12 states. [2019-09-08 10:55:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:52,944 INFO L93 Difference]: Finished difference Result 156831 states and 227116 transitions. [2019-09-08 10:55:52,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 10:55:52,945 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-09-08 10:55:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:53,366 INFO L225 Difference]: With dead ends: 156831 [2019-09-08 10:55:53,367 INFO L226 Difference]: Without dead ends: 144861 [2019-09-08 10:55:53,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3728 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1651, Invalid=7855, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 10:55:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144861 states. [2019-09-08 10:55:56,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144861 to 36823. [2019-09-08 10:55:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36823 states. [2019-09-08 10:55:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36823 states to 36823 states and 53002 transitions. [2019-09-08 10:55:56,971 INFO L78 Accepts]: Start accepts. Automaton has 36823 states and 53002 transitions. Word has length 83 [2019-09-08 10:55:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:56,971 INFO L475 AbstractCegarLoop]: Abstraction has 36823 states and 53002 transitions. [2019-09-08 10:55:56,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:55:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 36823 states and 53002 transitions. [2019-09-08 10:55:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:55:56,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:56,984 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:55:56,985 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:56,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:56,985 INFO L82 PathProgramCache]: Analyzing trace with hash 972468303, now seen corresponding path program 1 times [2019-09-08 10:55:56,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:56,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:56,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:56,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:56,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:57,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:57,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:55:57,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:55:57,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:55:57,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:55:57,077 INFO L87 Difference]: Start difference. First operand 36823 states and 53002 transitions. Second operand 3 states. [2019-09-08 10:56:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:01,270 INFO L93 Difference]: Finished difference Result 87084 states and 125918 transitions. [2019-09-08 10:56:01,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:56:01,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 10:56:01,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:01,432 INFO L225 Difference]: With dead ends: 87084 [2019-09-08 10:56:01,433 INFO L226 Difference]: Without dead ends: 55786 [2019-09-08 10:56:01,496 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-08 10:56:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55786 states. [2019-09-08 10:56:05,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55786 to 55784. [2019-09-08 10:56:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55784 states. [2019-09-08 10:56:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55784 states to 55784 states and 79980 transitions. [2019-09-08 10:56:05,380 INFO L78 Accepts]: Start accepts. Automaton has 55784 states and 79980 transitions. Word has length 83 [2019-09-08 10:56:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:05,380 INFO L475 AbstractCegarLoop]: Abstraction has 55784 states and 79980 transitions. [2019-09-08 10:56:05,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:56:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 55784 states and 79980 transitions. [2019-09-08 10:56:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:56:05,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:05,391 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:56:05,391 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:05,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:05,392 INFO L82 PathProgramCache]: Analyzing trace with hash -256954202, now seen corresponding path program 1 times [2019-09-08 10:56:05,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:05,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:05,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:05,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:05,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:56:05,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:05,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:56:05,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:56:05,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:56:05,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:56:05,481 INFO L87 Difference]: Start difference. First operand 55784 states and 79980 transitions. Second operand 6 states. [2019-09-08 10:56:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:16,044 INFO L93 Difference]: Finished difference Result 210474 states and 300591 transitions. [2019-09-08 10:56:16,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:56:16,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-08 10:56:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:16,338 INFO L225 Difference]: With dead ends: 210474 [2019-09-08 10:56:16,339 INFO L226 Difference]: Without dead ends: 154724 [2019-09-08 10:56:16,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:56:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154724 states. [2019-09-08 10:56:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154724 to 154720. [2019-09-08 10:56:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154720 states. [2019-09-08 10:56:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154720 states to 154720 states and 219484 transitions. [2019-09-08 10:56:29,653 INFO L78 Accepts]: Start accepts. Automaton has 154720 states and 219484 transitions. Word has length 83 [2019-09-08 10:56:29,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:29,653 INFO L475 AbstractCegarLoop]: Abstraction has 154720 states and 219484 transitions. [2019-09-08 10:56:29,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:56:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 154720 states and 219484 transitions. [2019-09-08 10:56:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:56:29,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:29,669 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:56:29,670 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:29,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:29,670 INFO L82 PathProgramCache]: Analyzing trace with hash -526229301, now seen corresponding path program 1 times [2019-09-08 10:56:29,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:29,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:29,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:29,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:29,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:56:29,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:56:29,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 10:56:29,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:56:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:29,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:56:29,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:56:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:56:30,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:56:30,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:56:30,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:56:30,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:56:30,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:56:30,462 INFO L87 Difference]: Start difference. First operand 154720 states and 219484 transitions. Second operand 11 states. [2019-09-08 10:56:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:57,812 INFO L93 Difference]: Finished difference Result 471335 states and 669122 transitions. [2019-09-08 10:56:57,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:56:57,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-09-08 10:56:57,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:58,445 INFO L225 Difference]: With dead ends: 471335 [2019-09-08 10:56:58,445 INFO L226 Difference]: Without dead ends: 337045 [2019-09-08 10:56:58,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:56:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337045 states. [2019-09-08 10:57:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337045 to 186528. [2019-09-08 10:57:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186528 states. [2019-09-08 10:57:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186528 states to 186528 states and 264428 transitions. [2019-09-08 10:57:21,211 INFO L78 Accepts]: Start accepts. Automaton has 186528 states and 264428 transitions. Word has length 83 [2019-09-08 10:57:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:21,211 INFO L475 AbstractCegarLoop]: Abstraction has 186528 states and 264428 transitions. [2019-09-08 10:57:21,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:57:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 186528 states and 264428 transitions. [2019-09-08 10:57:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:57:21,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:21,230 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:57:21,230 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:21,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:21,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2004680150, now seen corresponding path program 1 times [2019-09-08 10:57:21,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:21,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:21,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:21,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:21,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:21,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:21,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:57:21,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:57:21,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:57:21,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:57:21,288 INFO L87 Difference]: Start difference. First operand 186528 states and 264428 transitions. Second operand 3 states. [2019-09-08 10:57:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:46,383 INFO L93 Difference]: Finished difference Result 390560 states and 553079 transitions. [2019-09-08 10:57:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:57:46,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 10:57:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:47,012 INFO L225 Difference]: With dead ends: 390560 [2019-09-08 10:57:47,012 INFO L226 Difference]: Without dead ends: 266222 [2019-09-08 10:57:47,234 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-08 10:57:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266222 states. [2019-09-08 10:58:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266222 to 248996. [2019-09-08 10:58:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248996 states. [2019-09-08 10:58:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248996 states to 248996 states and 349177 transitions. [2019-09-08 10:58:08,962 INFO L78 Accepts]: Start accepts. Automaton has 248996 states and 349177 transitions. Word has length 83 [2019-09-08 10:58:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:08,962 INFO L475 AbstractCegarLoop]: Abstraction has 248996 states and 349177 transitions. [2019-09-08 10:58:08,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:58:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 248996 states and 349177 transitions. [2019-09-08 10:58:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:58:08,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:08,977 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:58:08,977 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:08,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:08,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1803451315, now seen corresponding path program 1 times [2019-09-08 10:58:08,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:08,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:08,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:58:09,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:09,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:58:09,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:58:09,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:58:09,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:58:09,045 INFO L87 Difference]: Start difference. First operand 248996 states and 349177 transitions. Second operand 3 states. [2019-09-08 10:58:35,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:35,239 INFO L93 Difference]: Finished difference Result 411456 states and 574389 transitions. [2019-09-08 10:58:35,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:58:35,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 10:58:35,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:35,619 INFO L225 Difference]: With dead ends: 411456 [2019-09-08 10:58:35,620 INFO L226 Difference]: Without dead ends: 262312 [2019-09-08 10:58:35,742 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-08 10:58:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262312 states. [2019-09-08 10:59:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262312 to 248223. [2019-09-08 10:59:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248223 states. [2019-09-08 10:59:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248223 states to 248223 states and 343081 transitions. [2019-09-08 10:59:02,390 INFO L78 Accepts]: Start accepts. Automaton has 248223 states and 343081 transitions. Word has length 83 [2019-09-08 10:59:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:02,390 INFO L475 AbstractCegarLoop]: Abstraction has 248223 states and 343081 transitions. [2019-09-08 10:59:02,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:59:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 248223 states and 343081 transitions. [2019-09-08 10:59:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:59:02,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:02,403 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:59:02,403 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:02,403 INFO L82 PathProgramCache]: Analyzing trace with hash -55443058, now seen corresponding path program 1 times [2019-09-08 10:59:02,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:02,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:02,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:02,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:02,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 10:59:02,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:02,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:59:02,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:59:02,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:59:02,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:59:02,486 INFO L87 Difference]: Start difference. First operand 248223 states and 343081 transitions. Second operand 6 states. [2019-09-08 11:00:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:03,265 INFO L93 Difference]: Finished difference Result 862290 states and 1187586 transitions. [2019-09-08 11:00:03,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:00:03,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-08 11:00:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:04,198 INFO L225 Difference]: With dead ends: 862290 [2019-09-08 11:00:04,198 INFO L226 Difference]: Without dead ends: 614281 [2019-09-08 11:00:04,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:00:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614281 states. [2019-09-08 11:01:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614281 to 605060. [2019-09-08 11:01:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605060 states. [2019-09-08 11:01:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605060 states to 605060 states and 830691 transitions. [2019-09-08 11:01:12,736 INFO L78 Accepts]: Start accepts. Automaton has 605060 states and 830691 transitions. Word has length 83 [2019-09-08 11:01:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:12,737 INFO L475 AbstractCegarLoop]: Abstraction has 605060 states and 830691 transitions. [2019-09-08 11:01:12,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:01:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 605060 states and 830691 transitions. [2019-09-08 11:01:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:01:12,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:12,752 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:01:12,752 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:12,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:12,753 INFO L82 PathProgramCache]: Analyzing trace with hash -212390925, now seen corresponding path program 1 times [2019-09-08 11:01:12,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:12,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:12,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:12,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:12,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:12,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:01:12,846 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-08 11:01:12,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:01:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:12,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:01:12,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:01:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:13,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:01:13,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:01:13,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:01:13,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:01:13,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:01:13,057 INFO L87 Difference]: Start difference. First operand 605060 states and 830691 transitions. Second operand 11 states. [2019-09-08 11:03:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:14,932 INFO L93 Difference]: Finished difference Result 1356628 states and 1856770 transitions. [2019-09-08 11:03:14,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:03:14,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-09-08 11:03:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:16,899 INFO L225 Difference]: With dead ends: 1356628 [2019-09-08 11:03:16,899 INFO L226 Difference]: Without dead ends: 1116018 [2019-09-08 11:03:17,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:03:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116018 states. [2019-09-08 11:04:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116018 to 659352. [2019-09-08 11:04:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659352 states. [2019-09-08 11:04:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659352 states to 659352 states and 904217 transitions. [2019-09-08 11:04:53,137 INFO L78 Accepts]: Start accepts. Automaton has 659352 states and 904217 transitions. Word has length 83 [2019-09-08 11:04:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:53,138 INFO L475 AbstractCegarLoop]: Abstraction has 659352 states and 904217 transitions. [2019-09-08 11:04:53,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:04:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 659352 states and 904217 transitions. [2019-09-08 11:04:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:04:53,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:53,156 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:53,156 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:53,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:53,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1701976494, now seen corresponding path program 1 times [2019-09-08 11:04:53,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:53,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:53,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:53,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:53,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:53,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:04:53,244 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-08 11:04:53,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:04:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:53,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:04:53,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:04:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:53,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:04:53,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:04:53,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:04:53,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:04:53,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:04:53,454 INFO L87 Difference]: Start difference. First operand 659352 states and 904217 transitions. Second operand 11 states.