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.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:36:50,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:36:50,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:36:50,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:36:50,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:36:50,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:36:50,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:36:50,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:36:50,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:36:50,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:36:50,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:36:50,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:36:50,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:36:50,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:36:50,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:36:50,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:36:50,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:36:50,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:36:50,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:36:50,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:36:50,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:36:50,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:36:50,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:36:50,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:36:50,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:36:50,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:36:50,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:36:50,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:36:50,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:36:50,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:36:50,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:36:50,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:36:50,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:36:50,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:36:50,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:36:50,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:36:50,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:36:50,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:36:50,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:36:50,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:36:50,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:36:50,235 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:36:50,254 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:36:50,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:36:50,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:36:50,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:36:50,256 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:36:50,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:36:50,256 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:36:50,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:36:50,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:36:50,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:36:50,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:36:50,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:36:50,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:36:50,258 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:36:50,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:36:50,258 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:36:50,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:36:50,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:36:50,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:36:50,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:36:50,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:36:50,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:36:50,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:36:50,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:36:50,260 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:36:50,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:36:50,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:36:50,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:36:50,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:36:50,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:36:50,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:36:50,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:36:50,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:36:50,306 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:36:50,307 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.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 10:36:50,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5fc0c5b/b278f634c59e498ea66bcd274802f5b7/FLAGbef5164e2 [2019-09-08 10:36:50,903 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:36:50,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 10:36:50,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5fc0c5b/b278f634c59e498ea66bcd274802f5b7/FLAGbef5164e2 [2019-09-08 10:36:51,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5fc0c5b/b278f634c59e498ea66bcd274802f5b7 [2019-09-08 10:36:51,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:36:51,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:36:51,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:36:51,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:36:51,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:36:51,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:36:51" (1/1) ... [2019-09-08 10:36:51,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379628a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:51, skipping insertion in model container [2019-09-08 10:36:51,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:36:51" (1/1) ... [2019-09-08 10:36:51,285 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:36:51,344 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:36:51,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:36:51,735 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:36:51,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:36:51,837 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:36:51,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:51 WrapperNode [2019-09-08 10:36:51,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:36:51,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:36:51,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:36:51,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:36:51,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:51" (1/1) ... [2019-09-08 10:36:51,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:51" (1/1) ... [2019-09-08 10:36:51,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:51" (1/1) ... [2019-09-08 10:36:51,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:51" (1/1) ... [2019-09-08 10:36:51,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:51" (1/1) ... [2019-09-08 10:36:51,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:51" (1/1) ... [2019-09-08 10:36:51,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:51" (1/1) ... [2019-09-08 10:36:51,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:36:51,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:36:51,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:36:51,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:36:51,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:51" (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:36:51,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:36:51,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:36:51,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:36:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:36:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:36:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:36:51,958 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:36:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:36:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:36:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:36:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:36:51,959 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:36:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:36:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:36:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:36:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:36:51,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:36:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:36:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:36:52,666 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:36:52,667 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:36:52,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:36:52 BoogieIcfgContainer [2019-09-08 10:36:52,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:36:52,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:36:52,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:36:52,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:36:52,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:36:51" (1/3) ... [2019-09-08 10:36:52,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394d459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:36:52, skipping insertion in model container [2019-09-08 10:36:52,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:51" (2/3) ... [2019-09-08 10:36:52,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394d459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:36:52, skipping insertion in model container [2019-09-08 10:36:52,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:36:52" (3/3) ... [2019-09-08 10:36:52,676 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 10:36:52,687 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:36:52,695 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:36:52,713 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:36:52,745 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:36:52,746 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:36:52,746 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:36:52,746 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:36:52,746 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:36:52,746 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:36:52,747 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:36:52,747 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:36:52,747 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:36:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-09-08 10:36:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 10:36:52,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:52,778 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] [2019-09-08 10:36:52,780 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1173815041, now seen corresponding path program 1 times [2019-09-08 10:36:52,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:52,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:52,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:52,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:52,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:53,224 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:36:53,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:53,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:53,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:53,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:53,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:53,252 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-09-08 10:36:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:53,349 INFO L93 Difference]: Finished difference Result 267 states and 426 transitions. [2019-09-08 10:36:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:53,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-08 10:36:53,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:53,369 INFO L225 Difference]: With dead ends: 267 [2019-09-08 10:36:53,370 INFO L226 Difference]: Without dead ends: 175 [2019-09-08 10:36:53,374 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:36:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-08 10:36:53,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2019-09-08 10:36:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-08 10:36:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 257 transitions. [2019-09-08 10:36:53,436 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 257 transitions. Word has length 52 [2019-09-08 10:36:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:53,436 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 257 transitions. [2019-09-08 10:36:53,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 257 transitions. [2019-09-08 10:36:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 10:36:53,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:53,440 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:36:53,441 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:53,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:53,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1357822606, now seen corresponding path program 1 times [2019-09-08 10:36:53,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:53,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:53,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:53,615 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:36:53,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:53,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:53,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:53,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:53,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:53,621 INFO L87 Difference]: Start difference. First operand 173 states and 257 transitions. Second operand 3 states. [2019-09-08 10:36:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:53,670 INFO L93 Difference]: Finished difference Result 425 states and 657 transitions. [2019-09-08 10:36:53,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:53,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-08 10:36:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:53,674 INFO L225 Difference]: With dead ends: 425 [2019-09-08 10:36:53,674 INFO L226 Difference]: Without dead ends: 283 [2019-09-08 10:36:53,676 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:36:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-08 10:36:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2019-09-08 10:36:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-08 10:36:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 428 transitions. [2019-09-08 10:36:53,737 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 428 transitions. Word has length 53 [2019-09-08 10:36:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:53,738 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 428 transitions. [2019-09-08 10:36:53,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 428 transitions. [2019-09-08 10:36:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:36:53,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:53,740 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:36:53,741 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:53,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1224986484, now seen corresponding path program 1 times [2019-09-08 10:36:53,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:53,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:53,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:53,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:53,884 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:36:53,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:53,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:53,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:53,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:53,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:53,886 INFO L87 Difference]: Start difference. First operand 281 states and 428 transitions. Second operand 3 states. [2019-09-08 10:36:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:53,945 INFO L93 Difference]: Finished difference Result 717 states and 1118 transitions. [2019-09-08 10:36:53,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:53,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-08 10:36:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:53,950 INFO L225 Difference]: With dead ends: 717 [2019-09-08 10:36:53,950 INFO L226 Difference]: Without dead ends: 467 [2019-09-08 10:36:53,952 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:36:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-08 10:36:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2019-09-08 10:36:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 10:36:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 716 transitions. [2019-09-08 10:36:54,008 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 716 transitions. Word has length 54 [2019-09-08 10:36:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:54,009 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 716 transitions. [2019-09-08 10:36:54,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 716 transitions. [2019-09-08 10:36:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:36:54,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:54,011 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:36:54,011 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:54,012 INFO L82 PathProgramCache]: Analyzing trace with hash 781354829, now seen corresponding path program 1 times [2019-09-08 10:36:54,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:54,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:54,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:54,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:54,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:54,080 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:36:54,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:54,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:54,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:54,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:54,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:54,081 INFO L87 Difference]: Start difference. First operand 465 states and 716 transitions. Second operand 3 states. [2019-09-08 10:36:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:54,128 INFO L93 Difference]: Finished difference Result 1205 states and 1878 transitions. [2019-09-08 10:36:54,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:54,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-08 10:36:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:54,134 INFO L225 Difference]: With dead ends: 1205 [2019-09-08 10:36:54,134 INFO L226 Difference]: Without dead ends: 771 [2019-09-08 10:36:54,137 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:36:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-09-08 10:36:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 769. [2019-09-08 10:36:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-09-08 10:36:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1184 transitions. [2019-09-08 10:36:54,188 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1184 transitions. Word has length 55 [2019-09-08 10:36:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:54,189 INFO L475 AbstractCegarLoop]: Abstraction has 769 states and 1184 transitions. [2019-09-08 10:36:54,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1184 transitions. [2019-09-08 10:36:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:36:54,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:54,191 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:36:54,191 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:54,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash -895952899, now seen corresponding path program 1 times [2019-09-08 10:36:54,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:54,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:54,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:54,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:54,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:54,299 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:36:54,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:54,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:36:54,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:36:54,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:36:54,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:36:54,301 INFO L87 Difference]: Start difference. First operand 769 states and 1184 transitions. Second operand 6 states. [2019-09-08 10:36:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:54,674 INFO L93 Difference]: Finished difference Result 4459 states and 6949 transitions. [2019-09-08 10:36:54,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:36:54,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:36:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:54,700 INFO L225 Difference]: With dead ends: 4459 [2019-09-08 10:36:54,701 INFO L226 Difference]: Without dead ends: 3721 [2019-09-08 10:36:54,704 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:36:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2019-09-08 10:36:54,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 1505. [2019-09-08 10:36:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2019-09-08 10:36:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2304 transitions. [2019-09-08 10:36:54,845 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2304 transitions. Word has length 56 [2019-09-08 10:36:54,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:54,845 INFO L475 AbstractCegarLoop]: Abstraction has 1505 states and 2304 transitions. [2019-09-08 10:36:54,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:36:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2304 transitions. [2019-09-08 10:36:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:36:54,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:54,852 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:36:54,852 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:54,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:54,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2023268854, now seen corresponding path program 1 times [2019-09-08 10:36:54,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:54,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:54,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:54,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:54,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:55,006 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:36:55,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:55,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:36:55,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:36:55,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:36:55,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:36:55,008 INFO L87 Difference]: Start difference. First operand 1505 states and 2304 transitions. Second operand 6 states. [2019-09-08 10:36:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:55,457 INFO L93 Difference]: Finished difference Result 6505 states and 9924 transitions. [2019-09-08 10:36:55,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:36:55,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-08 10:36:55,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:55,485 INFO L225 Difference]: With dead ends: 6505 [2019-09-08 10:36:55,485 INFO L226 Difference]: Without dead ends: 5031 [2019-09-08 10:36:55,490 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:36:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states. [2019-09-08 10:36:55,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 5025. [2019-09-08 10:36:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2019-09-08 10:36:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 7616 transitions. [2019-09-08 10:36:55,870 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 7616 transitions. Word has length 57 [2019-09-08 10:36:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:55,873 INFO L475 AbstractCegarLoop]: Abstraction has 5025 states and 7616 transitions. [2019-09-08 10:36:55,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:36:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 7616 transitions. [2019-09-08 10:36:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:36:55,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:55,879 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:36:55,879 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:55,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash -837113055, now seen corresponding path program 1 times [2019-09-08 10:36:55,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:55,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:55,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:55,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:55,995 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:36:55,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:55,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:36:55,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:36:55,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:36:55,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:36:55,997 INFO L87 Difference]: Start difference. First operand 5025 states and 7616 transitions. Second operand 5 states. [2019-09-08 10:36:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:57,007 INFO L93 Difference]: Finished difference Result 15013 states and 22786 transitions. [2019-09-08 10:36:57,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:36:57,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 10:36:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:57,064 INFO L225 Difference]: With dead ends: 15013 [2019-09-08 10:36:57,065 INFO L226 Difference]: Without dead ends: 10019 [2019-09-08 10:36:57,079 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:36:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10019 states. [2019-09-08 10:36:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10019 to 10017. [2019-09-08 10:36:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10017 states. [2019-09-08 10:36:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10017 states to 10017 states and 15088 transitions. [2019-09-08 10:36:57,776 INFO L78 Accepts]: Start accepts. Automaton has 10017 states and 15088 transitions. Word has length 59 [2019-09-08 10:36:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:57,778 INFO L475 AbstractCegarLoop]: Abstraction has 10017 states and 15088 transitions. [2019-09-08 10:36:57,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:36:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 10017 states and 15088 transitions. [2019-09-08 10:36:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:36:57,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:57,779 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:36:57,780 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:57,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:57,780 INFO L82 PathProgramCache]: Analyzing trace with hash 932858652, now seen corresponding path program 1 times [2019-09-08 10:36:57,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:57,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:57,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:57,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:57,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:57,872 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:36:57,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:57,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:36:57,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:36:57,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:36:57,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:36:57,874 INFO L87 Difference]: Start difference. First operand 10017 states and 15088 transitions. Second operand 5 states. [2019-09-08 10:36:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:59,194 INFO L93 Difference]: Finished difference Result 20515 states and 30657 transitions. [2019-09-08 10:36:59,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:36:59,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 10:36:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:59,282 INFO L225 Difference]: With dead ends: 20515 [2019-09-08 10:36:59,282 INFO L226 Difference]: Without dead ends: 20513 [2019-09-08 10:36:59,291 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:36:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20513 states. [2019-09-08 10:37:00,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20513 to 10529. [2019-09-08 10:37:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10529 states. [2019-09-08 10:37:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10529 states to 10529 states and 15600 transitions. [2019-09-08 10:37:00,313 INFO L78 Accepts]: Start accepts. Automaton has 10529 states and 15600 transitions. Word has length 59 [2019-09-08 10:37:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:00,314 INFO L475 AbstractCegarLoop]: Abstraction has 10529 states and 15600 transitions. [2019-09-08 10:37:00,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:37:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 10529 states and 15600 transitions. [2019-09-08 10:37:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:37:00,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:00,315 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:37:00,316 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1136533126, now seen corresponding path program 1 times [2019-09-08 10:37:00,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:00,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:00,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:00,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:00,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:00,377 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:37:00,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:00,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:00,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:00,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:00,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:00,379 INFO L87 Difference]: Start difference. First operand 10529 states and 15600 transitions. Second operand 3 states. [2019-09-08 10:37:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:01,350 INFO L93 Difference]: Finished difference Result 23391 states and 34592 transitions. [2019-09-08 10:37:01,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:01,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:37:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:01,383 INFO L225 Difference]: With dead ends: 23391 [2019-09-08 10:37:01,383 INFO L226 Difference]: Without dead ends: 12893 [2019-09-08 10:37:01,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:37:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12893 states. [2019-09-08 10:37:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12893 to 12891. [2019-09-08 10:37:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12891 states. [2019-09-08 10:37:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12891 states to 12891 states and 18966 transitions. [2019-09-08 10:37:02,219 INFO L78 Accepts]: Start accepts. Automaton has 12891 states and 18966 transitions. Word has length 60 [2019-09-08 10:37:02,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:02,220 INFO L475 AbstractCegarLoop]: Abstraction has 12891 states and 18966 transitions. [2019-09-08 10:37:02,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 12891 states and 18966 transitions. [2019-09-08 10:37:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:37:02,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:02,227 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] [2019-09-08 10:37:02,228 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:02,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash 324055568, now seen corresponding path program 1 times [2019-09-08 10:37:02,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:02,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:02,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:02,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:02,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:02,331 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:37:02,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:37:02,331 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) [2019-09-08 10:37:02,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:37:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:02,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 10:37:02,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:37:02,538 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:37:02,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:37:02,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2019-09-08 10:37:02,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:37:02,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:37:02,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:37:02,555 INFO L87 Difference]: Start difference. First operand 12891 states and 18966 transitions. Second operand 5 states. [2019-09-08 10:37:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:04,815 INFO L93 Difference]: Finished difference Result 33583 states and 49473 transitions. [2019-09-08 10:37:04,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:37:04,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 10:37:04,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:04,870 INFO L225 Difference]: With dead ends: 33583 [2019-09-08 10:37:04,870 INFO L226 Difference]: Without dead ends: 23085 [2019-09-08 10:37:04,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:37:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23085 states. [2019-09-08 10:37:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23085 to 22051. [2019-09-08 10:37:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22051 states. [2019-09-08 10:37:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22051 states to 22051 states and 32166 transitions. [2019-09-08 10:37:06,639 INFO L78 Accepts]: Start accepts. Automaton has 22051 states and 32166 transitions. Word has length 81 [2019-09-08 10:37:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:06,639 INFO L475 AbstractCegarLoop]: Abstraction has 22051 states and 32166 transitions. [2019-09-08 10:37:06,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:37:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 22051 states and 32166 transitions. [2019-09-08 10:37:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:37:06,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:06,647 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-08 10:37:06,647 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:06,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash 429171158, now seen corresponding path program 1 times [2019-09-08 10:37:06,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:06,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:06,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:06,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:06,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:06,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:06,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:06,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:06,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:06,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:06,719 INFO L87 Difference]: Start difference. First operand 22051 states and 32166 transitions. Second operand 3 states. [2019-09-08 10:37:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:08,488 INFO L93 Difference]: Finished difference Result 52700 states and 76728 transitions. [2019-09-08 10:37:08,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:08,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 10:37:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:08,588 INFO L225 Difference]: With dead ends: 52700 [2019-09-08 10:37:08,589 INFO L226 Difference]: Without dead ends: 34866 [2019-09-08 10:37:08,638 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:37:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34866 states. [2019-09-08 10:37:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34866 to 33440. [2019-09-08 10:37:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33440 states. [2019-09-08 10:37:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33440 states to 33440 states and 48204 transitions. [2019-09-08 10:37:10,618 INFO L78 Accepts]: Start accepts. Automaton has 33440 states and 48204 transitions. Word has length 82 [2019-09-08 10:37:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:10,619 INFO L475 AbstractCegarLoop]: Abstraction has 33440 states and 48204 transitions. [2019-09-08 10:37:10,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 33440 states and 48204 transitions. [2019-09-08 10:37:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:37:10,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:10,628 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-08 10:37:10,628 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1049279691, now seen corresponding path program 1 times [2019-09-08 10:37:10,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:10,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:10,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:10,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:10,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:10,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:10,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:10,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:10,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:10,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:10,695 INFO L87 Difference]: Start difference. First operand 33440 states and 48204 transitions. Second operand 3 states. [2019-09-08 10:37:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:13,957 INFO L93 Difference]: Finished difference Result 70658 states and 101395 transitions. [2019-09-08 10:37:13,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:13,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 10:37:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:14,070 INFO L225 Difference]: With dead ends: 70658 [2019-09-08 10:37:14,070 INFO L226 Difference]: Without dead ends: 47600 [2019-09-08 10:37:14,120 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:37:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47600 states. [2019-09-08 10:37:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47600 to 45526. [2019-09-08 10:37:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45526 states. [2019-09-08 10:37:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45526 states to 45526 states and 64689 transitions. [2019-09-08 10:37:16,496 INFO L78 Accepts]: Start accepts. Automaton has 45526 states and 64689 transitions. Word has length 82 [2019-09-08 10:37:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:16,497 INFO L475 AbstractCegarLoop]: Abstraction has 45526 states and 64689 transitions. [2019-09-08 10:37:16,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 45526 states and 64689 transitions. [2019-09-08 10:37:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:37:16,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:16,507 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-08 10:37:16,507 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:16,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:16,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1536115522, now seen corresponding path program 1 times [2019-09-08 10:37:16,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:16,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:16,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:16,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:16,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:16,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:16,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:16,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:16,567 INFO L87 Difference]: Start difference. First operand 45526 states and 64689 transitions. Second operand 3 states. [2019-09-08 10:37:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:18,981 INFO L93 Difference]: Finished difference Result 75069 states and 106014 transitions. [2019-09-08 10:37:18,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:18,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 10:37:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:19,065 INFO L225 Difference]: With dead ends: 75069 [2019-09-08 10:37:19,065 INFO L226 Difference]: Without dead ends: 47577 [2019-09-08 10:37:19,111 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:37:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47577 states. [2019-09-08 10:37:22,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47577 to 45741. [2019-09-08 10:37:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45741 states. [2019-09-08 10:37:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45741 states to 45741 states and 63955 transitions. [2019-09-08 10:37:22,533 INFO L78 Accepts]: Start accepts. Automaton has 45741 states and 63955 transitions. Word has length 82 [2019-09-08 10:37:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:22,533 INFO L475 AbstractCegarLoop]: Abstraction has 45741 states and 63955 transitions. [2019-09-08 10:37:22,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 45741 states and 63955 transitions. [2019-09-08 10:37:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:37:22,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:22,541 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-08 10:37:22,541 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:22,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1323355809, now seen corresponding path program 1 times [2019-09-08 10:37:22,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:22,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:22,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:22,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:37:22,644 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:37:22,660 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:37:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:22,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:37:22,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:37:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:22,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:37:22,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:37:22,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:37:22,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:37:22,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:37:22,914 INFO L87 Difference]: Start difference. First operand 45741 states and 63955 transitions. Second operand 11 states. [2019-09-08 10:37:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:27,281 INFO L93 Difference]: Finished difference Result 99564 states and 138243 transitions. [2019-09-08 10:37:27,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:37:27,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2019-09-08 10:37:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:27,368 INFO L225 Difference]: With dead ends: 99564 [2019-09-08 10:37:27,368 INFO L226 Difference]: Without dead ends: 69277 [2019-09-08 10:37:27,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:37:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69277 states. [2019-09-08 10:37:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69277 to 47496. [2019-09-08 10:37:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47496 states. [2019-09-08 10:37:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47496 states to 47496 states and 65902 transitions. [2019-09-08 10:37:31,540 INFO L78 Accepts]: Start accepts. Automaton has 47496 states and 65902 transitions. Word has length 82 [2019-09-08 10:37:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:31,541 INFO L475 AbstractCegarLoop]: Abstraction has 47496 states and 65902 transitions. [2019-09-08 10:37:31,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:37:31,541 INFO L276 IsEmpty]: Start isEmpty. Operand 47496 states and 65902 transitions. [2019-09-08 10:37:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:37:31,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:31,549 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-08 10:37:31,549 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:31,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:31,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1637885217, now seen corresponding path program 1 times [2019-09-08 10:37:31,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:31,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:31,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:31,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:31,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:37:31,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:31,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:37:31,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:37:31,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:37:31,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:37:31,642 INFO L87 Difference]: Start difference. First operand 47496 states and 65902 transitions. Second operand 6 states. [2019-09-08 10:37:38,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:38,303 INFO L93 Difference]: Finished difference Result 164030 states and 226756 transitions. [2019-09-08 10:37:38,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:37:38,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-09-08 10:37:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:38,458 INFO L225 Difference]: With dead ends: 164030 [2019-09-08 10:37:38,458 INFO L226 Difference]: Without dead ends: 116593 [2019-09-08 10:37:38,512 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:37:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116593 states. [2019-09-08 10:37:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116593 to 115018. [2019-09-08 10:37:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115018 states. [2019-09-08 10:37:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115018 states to 115018 states and 158446 transitions. [2019-09-08 10:37:46,950 INFO L78 Accepts]: Start accepts. Automaton has 115018 states and 158446 transitions. Word has length 82 [2019-09-08 10:37:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:46,951 INFO L475 AbstractCegarLoop]: Abstraction has 115018 states and 158446 transitions. [2019-09-08 10:37:46,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:37:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 115018 states and 158446 transitions. [2019-09-08 10:37:46,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:37:46,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:46,961 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-08 10:37:46,961 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:46,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:46,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1092382182, now seen corresponding path program 1 times [2019-09-08 10:37:46,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:46,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:46,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:46,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:46,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:47,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:37:47,044 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 10:37:47,061 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 10:37:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:47,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:37:47,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:37:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 10:37:47,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:37:47,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:37:47,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:37:47,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:37:47,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:37:47,260 INFO L87 Difference]: Start difference. First operand 115018 states and 158446 transitions. Second operand 11 states. [2019-09-08 10:38:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:06,230 INFO L93 Difference]: Finished difference Result 359346 states and 495615 transitions. [2019-09-08 10:38:06,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:38:06,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2019-09-08 10:38:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:06,630 INFO L225 Difference]: With dead ends: 359346 [2019-09-08 10:38:06,630 INFO L226 Difference]: Without dead ends: 261644 [2019-09-08 10:38:06,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:38:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261644 states. [2019-09-08 10:38:21,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261644 to 130615. [2019-09-08 10:38:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130615 states. [2019-09-08 10:38:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130615 states to 130615 states and 180223 transitions. [2019-09-08 10:38:21,239 INFO L78 Accepts]: Start accepts. Automaton has 130615 states and 180223 transitions. Word has length 82 [2019-09-08 10:38:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:21,239 INFO L475 AbstractCegarLoop]: Abstraction has 130615 states and 180223 transitions. [2019-09-08 10:38:21,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:38:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 130615 states and 180223 transitions. [2019-09-08 10:38:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:38:21,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:21,251 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-08 10:38:21,251 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:21,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1308447856, now seen corresponding path program 1 times [2019-09-08 10:38:21,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:21,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:21,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:21,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:21,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 10:38:21,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:21,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:38:21,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:38:21,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:38:21,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:38:21,343 INFO L87 Difference]: Start difference. First operand 130615 states and 180223 transitions. Second operand 6 states. [2019-09-08 10:38:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:46,784 INFO L93 Difference]: Finished difference Result 452823 states and 622478 transitions. [2019-09-08 10:38:46,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:38:46,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-09-08 10:38:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:47,291 INFO L225 Difference]: With dead ends: 452823 [2019-09-08 10:38:47,291 INFO L226 Difference]: Without dead ends: 322312 [2019-09-08 10:38:47,437 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:38:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322312 states. [2019-09-08 10:39:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322312 to 316162. [2019-09-08 10:39:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316162 states. [2019-09-08 10:39:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316162 states to 316162 states and 433138 transitions. [2019-09-08 10:39:21,212 INFO L78 Accepts]: Start accepts. Automaton has 316162 states and 433138 transitions. Word has length 82 [2019-09-08 10:39:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:21,213 INFO L475 AbstractCegarLoop]: Abstraction has 316162 states and 433138 transitions. [2019-09-08 10:39:21,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:39:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 316162 states and 433138 transitions. [2019-09-08 10:39:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:39:21,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:21,225 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-08 10:39:21,226 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:21,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash 596777845, now seen corresponding path program 1 times [2019-09-08 10:39:21,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:21,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:21,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:21,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:39:21,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:39:21,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:39:21,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:21,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:39:21,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:39:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:39:21,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:39:21,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:39:21,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:39:21,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:39:21,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:39:21,538 INFO L87 Difference]: Start difference. First operand 316162 states and 433138 transitions. Second operand 11 states. [2019-09-08 10:40:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:11,300 INFO L93 Difference]: Finished difference Result 732658 states and 1001093 transitions. [2019-09-08 10:40:11,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:40:11,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2019-09-08 10:40:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:12,156 INFO L225 Difference]: With dead ends: 732658 [2019-09-08 10:40:12,156 INFO L226 Difference]: Without dead ends: 514799 [2019-09-08 10:40:12,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:40:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514799 states. [2019-09-08 10:40:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514799 to 332542. [2019-09-08 10:40:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332542 states. [2019-09-08 10:40:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332542 states to 332542 states and 455312 transitions. [2019-09-08 10:40:57,617 INFO L78 Accepts]: Start accepts. Automaton has 332542 states and 455312 transitions. Word has length 82 [2019-09-08 10:40:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:57,618 INFO L475 AbstractCegarLoop]: Abstraction has 332542 states and 455312 transitions. [2019-09-08 10:40:57,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:40:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 332542 states and 455312 transitions. [2019-09-08 10:40:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:40:57,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:57,630 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-08 10:40:57,631 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash 761692103, now seen corresponding path program 1 times [2019-09-08 10:40:57,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:57,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:57,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 10:40:57,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:57,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:40:57,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:40:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:40:57,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:40:57,707 INFO L87 Difference]: Start difference. First operand 332542 states and 455312 transitions. Second operand 6 states. [2019-09-08 10:42:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:25,440 INFO L93 Difference]: Finished difference Result 1128948 states and 1539938 transitions. [2019-09-08 10:42:25,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:42:25,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-09-08 10:42:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:26,934 INFO L225 Difference]: With dead ends: 1128948 [2019-09-08 10:42:26,934 INFO L226 Difference]: Without dead ends: 796562 [2019-09-08 10:42:27,829 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:42:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796562 states. [2019-09-08 10:44:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796562 to 784740. [2019-09-08 10:44:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784740 states. [2019-09-08 10:44:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784740 states to 784740 states and 1066476 transitions. [2019-09-08 10:44:04,633 INFO L78 Accepts]: Start accepts. Automaton has 784740 states and 1066476 transitions. Word has length 82 [2019-09-08 10:44:04,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:04,633 INFO L475 AbstractCegarLoop]: Abstraction has 784740 states and 1066476 transitions. [2019-09-08 10:44:04,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:44:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 784740 states and 1066476 transitions. [2019-09-08 10:44:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:44:04,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:04,650 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-08 10:44:04,650 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:04,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:04,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2014317374, now seen corresponding path program 1 times [2019-09-08 10:44:04,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:04,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:04,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:04,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:04,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:04,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:44:04,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 10:44:04,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:44:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:04,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:44:04,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:44:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:05,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:44:05,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:44:05,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:44:05,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:44:05,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:44:05,017 INFO L87 Difference]: Start difference. First operand 784740 states and 1066476 transitions. Second operand 11 states. [2019-09-08 10:46:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:41,970 INFO L93 Difference]: Finished difference Result 1557701 states and 2105153 transitions. [2019-09-08 10:46:41,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:46:41,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2019-09-08 10:46:41,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:44,886 INFO L225 Difference]: With dead ends: 1557701 [2019-09-08 10:46:44,886 INFO L226 Difference]: Without dead ends: 1240575 [2019-09-08 10:46:45,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:46:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240575 states.