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.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:29:37,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:29:37,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:29:37,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:29:37,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:29:37,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:29:37,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:29:37,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:29:37,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:29:37,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:29:37,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:29:37,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:29:37,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:29:37,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:29:37,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:29:37,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:29:37,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:29:37,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:29:37,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:29:37,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:29:37,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:29:37,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:29:37,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:29:37,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:29:37,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:29:37,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:29:37,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:29:37,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:29:37,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:29:37,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:29:37,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:29:37,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:29:37,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:29:37,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:29:37,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:29:37,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:29:37,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:29:37,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:29:37,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:29:37,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:29:37,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:29:37,938 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:29:37,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:29:37,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:29:37,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:29:37,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:29:37,955 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:29:37,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:29:37,955 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:29:37,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:29:37,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:29:37,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:29:37,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:29:37,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:29:37,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:29:37,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:29:37,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:29:37,958 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:29:37,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:29:37,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:29:37,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:29:37,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:29:37,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:29:37,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:29:37,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:29:37,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:29:37,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:29:37,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:29:37,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:29:37,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:29:37,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:29:38,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:29:38,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:29:38,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:29:38,017 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:29:38,017 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:29:38,018 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.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 10:29:38,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2272b5ec/f02fcd3d46d343f3a950b8c2faaf2eba/FLAG24cddfef2 [2019-09-08 10:29:38,586 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:29:38,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 10:29:38,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2272b5ec/f02fcd3d46d343f3a950b8c2faaf2eba/FLAG24cddfef2 [2019-09-08 10:29:38,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2272b5ec/f02fcd3d46d343f3a950b8c2faaf2eba [2019-09-08 10:29:38,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:29:38,931 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:29:38,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:29:38,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:29:38,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:29:38,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:29:38" (1/1) ... [2019-09-08 10:29:38,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4741b8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:38, skipping insertion in model container [2019-09-08 10:29:38,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:29:38" (1/1) ... [2019-09-08 10:29:38,947 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:29:38,994 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:29:39,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:29:39,370 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:29:39,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:29:39,457 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:29:39,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:39 WrapperNode [2019-09-08 10:29:39,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:29:39,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:29:39,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:29:39,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:29:39,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:39" (1/1) ... [2019-09-08 10:29:39,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:39" (1/1) ... [2019-09-08 10:29:39,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:39" (1/1) ... [2019-09-08 10:29:39,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:39" (1/1) ... [2019-09-08 10:29:39,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:39" (1/1) ... [2019-09-08 10:29:39,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:39" (1/1) ... [2019-09-08 10:29:39,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:39" (1/1) ... [2019-09-08 10:29:39,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:29:39,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:29:39,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:29:39,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:29:39,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:39" (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:29:39,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:29:39,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:29:39,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:29:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:29:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:29:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:29:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:29:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:29:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:29:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:29:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:29:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:29:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:29:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:29:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:29:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:29:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:29:39,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:29:40,154 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:29:40,154 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:29:40,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:29:40 BoogieIcfgContainer [2019-09-08 10:29:40,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:29:40,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:29:40,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:29:40,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:29:40,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:29:38" (1/3) ... [2019-09-08 10:29:40,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1dcd5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:29:40, skipping insertion in model container [2019-09-08 10:29:40,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:39" (2/3) ... [2019-09-08 10:29:40,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1dcd5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:29:40, skipping insertion in model container [2019-09-08 10:29:40,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:29:40" (3/3) ... [2019-09-08 10:29:40,163 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 10:29:40,176 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:29:40,195 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:29:40,212 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:29:40,245 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:29:40,246 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:29:40,246 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:29:40,246 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:29:40,246 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:29:40,247 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:29:40,247 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:29:40,247 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:29:40,247 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:29:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-09-08 10:29:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 10:29:40,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:40,278 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] [2019-09-08 10:29:40,280 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:40,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:40,288 INFO L82 PathProgramCache]: Analyzing trace with hash -60281297, now seen corresponding path program 1 times [2019-09-08 10:29:40,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:40,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:40,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:40,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:40,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:40,639 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:29:40,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:40,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:29:40,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:29:40,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:29:40,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:29:40,664 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2019-09-08 10:29:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:40,743 INFO L93 Difference]: Finished difference Result 206 states and 325 transitions. [2019-09-08 10:29:40,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:29:40,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-09-08 10:29:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:40,758 INFO L225 Difference]: With dead ends: 206 [2019-09-08 10:29:40,758 INFO L226 Difference]: Without dead ends: 132 [2019-09-08 10:29:40,762 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:29:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-08 10:29:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-09-08 10:29:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-08 10:29:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 192 transitions. [2019-09-08 10:29:40,830 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 192 transitions. Word has length 41 [2019-09-08 10:29:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:40,831 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 192 transitions. [2019-09-08 10:29:40,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:29:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 192 transitions. [2019-09-08 10:29:40,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 10:29:40,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:40,834 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] [2019-09-08 10:29:40,834 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:40,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:40,835 INFO L82 PathProgramCache]: Analyzing trace with hash 213438414, now seen corresponding path program 1 times [2019-09-08 10:29:40,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:40,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:40,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:40,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:40,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:40,976 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:29:40,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:40,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:29:40,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:29:40,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:29:40,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:29:40,981 INFO L87 Difference]: Start difference. First operand 130 states and 192 transitions. Second operand 3 states. [2019-09-08 10:29:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:41,072 INFO L93 Difference]: Finished difference Result 310 states and 476 transitions. [2019-09-08 10:29:41,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:29:41,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-09-08 10:29:41,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:41,078 INFO L225 Difference]: With dead ends: 310 [2019-09-08 10:29:41,078 INFO L226 Difference]: Without dead ends: 204 [2019-09-08 10:29:41,082 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:29:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-08 10:29:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2019-09-08 10:29:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-08 10:29:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 305 transitions. [2019-09-08 10:29:41,139 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 305 transitions. Word has length 42 [2019-09-08 10:29:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:41,141 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 305 transitions. [2019-09-08 10:29:41,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:29:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 305 transitions. [2019-09-08 10:29:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-08 10:29:41,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:41,144 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] [2019-09-08 10:29:41,146 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:41,147 INFO L82 PathProgramCache]: Analyzing trace with hash -511864306, now seen corresponding path program 1 times [2019-09-08 10:29:41,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:41,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:41,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:41,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:41,326 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:29:41,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:41,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:29:41,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:29:41,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:29:41,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:29:41,328 INFO L87 Difference]: Start difference. First operand 202 states and 305 transitions. Second operand 3 states. [2019-09-08 10:29:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:41,398 INFO L93 Difference]: Finished difference Result 494 states and 763 transitions. [2019-09-08 10:29:41,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:29:41,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-08 10:29:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:41,403 INFO L225 Difference]: With dead ends: 494 [2019-09-08 10:29:41,403 INFO L226 Difference]: Without dead ends: 316 [2019-09-08 10:29:41,405 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:29:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-08 10:29:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 314. [2019-09-08 10:29:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 10:29:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 477 transitions. [2019-09-08 10:29:41,462 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 477 transitions. Word has length 43 [2019-09-08 10:29:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:41,464 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 477 transitions. [2019-09-08 10:29:41,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:29:41,465 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 477 transitions. [2019-09-08 10:29:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 10:29:41,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:41,466 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] [2019-09-08 10:29:41,469 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:41,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:41,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1963926839, now seen corresponding path program 1 times [2019-09-08 10:29:41,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:41,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:41,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:41,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:41,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:41,593 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:29:41,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:41,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:29:41,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:29:41,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:29:41,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:29:41,594 INFO L87 Difference]: Start difference. First operand 314 states and 477 transitions. Second operand 5 states. [2019-09-08 10:29:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:41,758 INFO L93 Difference]: Finished difference Result 1474 states and 2289 transitions. [2019-09-08 10:29:41,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:29:41,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-09-08 10:29:41,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:41,766 INFO L225 Difference]: With dead ends: 1474 [2019-09-08 10:29:41,767 INFO L226 Difference]: Without dead ends: 1184 [2019-09-08 10:29:41,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:29:41,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-09-08 10:29:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2019-09-08 10:29:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-08 10:29:41,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 913 transitions. [2019-09-08 10:29:41,832 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 913 transitions. Word has length 44 [2019-09-08 10:29:41,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:41,833 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 913 transitions. [2019-09-08 10:29:41,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:29:41,833 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 913 transitions. [2019-09-08 10:29:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-08 10:29:41,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:41,835 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] [2019-09-08 10:29:41,835 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:41,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:41,836 INFO L82 PathProgramCache]: Analyzing trace with hash 733657067, now seen corresponding path program 1 times [2019-09-08 10:29:41,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:41,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:41,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:41,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:41,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:41,926 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:29:41,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:41,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:29:41,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:29:41,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:29:41,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:29:41,928 INFO L87 Difference]: Start difference. First operand 602 states and 913 transitions. Second operand 5 states. [2019-09-08 10:29:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:42,101 INFO L93 Difference]: Finished difference Result 2072 states and 3148 transitions. [2019-09-08 10:29:42,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:29:42,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-08 10:29:42,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:42,111 INFO L225 Difference]: With dead ends: 2072 [2019-09-08 10:29:42,111 INFO L226 Difference]: Without dead ends: 1494 [2019-09-08 10:29:42,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:29:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-09-08 10:29:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1490. [2019-09-08 10:29:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2019-09-08 10:29:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2241 transitions. [2019-09-08 10:29:42,240 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2241 transitions. Word has length 45 [2019-09-08 10:29:42,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:42,241 INFO L475 AbstractCegarLoop]: Abstraction has 1490 states and 2241 transitions. [2019-09-08 10:29:42,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:29:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2241 transitions. [2019-09-08 10:29:42,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 10:29:42,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:42,243 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] [2019-09-08 10:29:42,243 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:42,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:42,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1649759948, now seen corresponding path program 1 times [2019-09-08 10:29:42,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:42,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:42,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:42,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:42,313 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:29:42,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:42,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:29:42,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:29:42,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:29:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:29:42,315 INFO L87 Difference]: Start difference. First operand 1490 states and 2241 transitions. Second operand 5 states. [2019-09-08 10:29:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:42,675 INFO L93 Difference]: Finished difference Result 3982 states and 6011 transitions. [2019-09-08 10:29:42,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:29:42,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-09-08 10:29:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:42,689 INFO L225 Difference]: With dead ends: 3982 [2019-09-08 10:29:42,690 INFO L226 Difference]: Without dead ends: 2516 [2019-09-08 10:29:42,694 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:29:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-09-08 10:29:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2514. [2019-09-08 10:29:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-09-08 10:29:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3753 transitions. [2019-09-08 10:29:42,904 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3753 transitions. Word has length 47 [2019-09-08 10:29:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:42,905 INFO L475 AbstractCegarLoop]: Abstraction has 2514 states and 3753 transitions. [2019-09-08 10:29:42,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:29:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3753 transitions. [2019-09-08 10:29:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 10:29:42,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:42,907 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] [2019-09-08 10:29:42,907 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:42,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:42,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1830795353, now seen corresponding path program 1 times [2019-09-08 10:29:42,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:42,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:42,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:43,003 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:29:43,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:43,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:29:43,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:29:43,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:29:43,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:29:43,005 INFO L87 Difference]: Start difference. First operand 2514 states and 3753 transitions. Second operand 5 states. [2019-09-08 10:29:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:43,377 INFO L93 Difference]: Finished difference Result 5164 states and 7642 transitions. [2019-09-08 10:29:43,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:29:43,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-09-08 10:29:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:43,407 INFO L225 Difference]: With dead ends: 5164 [2019-09-08 10:29:43,408 INFO L226 Difference]: Without dead ends: 5162 [2019-09-08 10:29:43,409 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:29:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5162 states. [2019-09-08 10:29:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5162 to 2674. [2019-09-08 10:29:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-09-08 10:29:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3913 transitions. [2019-09-08 10:29:43,646 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3913 transitions. Word has length 47 [2019-09-08 10:29:43,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:43,646 INFO L475 AbstractCegarLoop]: Abstraction has 2674 states and 3913 transitions. [2019-09-08 10:29:43,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:29:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3913 transitions. [2019-09-08 10:29:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 10:29:43,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:43,648 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] [2019-09-08 10:29:43,648 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:43,649 INFO L82 PathProgramCache]: Analyzing trace with hash 929700792, now seen corresponding path program 1 times [2019-09-08 10:29:43,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:43,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:43,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:43,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:43,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:43,700 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:29:43,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:43,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:29:43,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:29:43,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:29:43,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:29:43,701 INFO L87 Difference]: Start difference. First operand 2674 states and 3913 transitions. Second operand 3 states. [2019-09-08 10:29:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:44,045 INFO L93 Difference]: Finished difference Result 5996 states and 8757 transitions. [2019-09-08 10:29:44,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:29:44,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-08 10:29:44,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:44,068 INFO L225 Difference]: With dead ends: 5996 [2019-09-08 10:29:44,069 INFO L226 Difference]: Without dead ends: 3346 [2019-09-08 10:29:44,075 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:29:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-09-08 10:29:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 3344. [2019-09-08 10:29:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3344 states. [2019-09-08 10:29:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3344 states to 3344 states and 4847 transitions. [2019-09-08 10:29:44,425 INFO L78 Accepts]: Start accepts. Automaton has 3344 states and 4847 transitions. Word has length 48 [2019-09-08 10:29:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:44,425 INFO L475 AbstractCegarLoop]: Abstraction has 3344 states and 4847 transitions. [2019-09-08 10:29:44,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:29:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 4847 transitions. [2019-09-08 10:29:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 10:29:44,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:44,430 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] [2019-09-08 10:29:44,430 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:44,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1357425763, now seen corresponding path program 1 times [2019-09-08 10:29:44,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:44,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:44,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:44,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 10:29:44,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:29:44,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:29:44,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:44,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 10:29:44,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:29:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 10:29:44,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:29:44,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2019-09-08 10:29:44,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:29:44,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:29:44,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:29:44,798 INFO L87 Difference]: Start difference. First operand 3344 states and 4847 transitions. Second operand 5 states. [2019-09-08 10:29:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:45,439 INFO L93 Difference]: Finished difference Result 8710 states and 12658 transitions. [2019-09-08 10:29:45,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:29:45,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-08 10:29:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:45,475 INFO L225 Difference]: With dead ends: 8710 [2019-09-08 10:29:45,476 INFO L226 Difference]: Without dead ends: 6060 [2019-09-08 10:29:45,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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:29:45,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2019-09-08 10:29:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 5752. [2019-09-08 10:29:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5752 states. [2019-09-08 10:29:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 8255 transitions. [2019-09-08 10:29:46,063 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 8255 transitions. Word has length 65 [2019-09-08 10:29:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:46,064 INFO L475 AbstractCegarLoop]: Abstraction has 5752 states and 8255 transitions. [2019-09-08 10:29:46,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:29:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 8255 transitions. [2019-09-08 10:29:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:29:46,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:46,067 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:29:46,067 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:46,068 INFO L82 PathProgramCache]: Analyzing trace with hash -157142588, now seen corresponding path program 1 times [2019-09-08 10:29:46,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:46,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:46,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:46,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:46,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:29:46,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:29:46,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:29:46,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:46,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:29:46,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:29:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:29:46,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:29:46,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:29:46,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:29:46,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:29:46,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:29:46,388 INFO L87 Difference]: Start difference. First operand 5752 states and 8255 transitions. Second operand 11 states. [2019-09-08 10:29:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:47,824 INFO L93 Difference]: Finished difference Result 13288 states and 18920 transitions. [2019-09-08 10:29:47,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:29:47,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-09-08 10:29:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:47,895 INFO L225 Difference]: With dead ends: 13288 [2019-09-08 10:29:47,895 INFO L226 Difference]: Without dead ends: 9300 [2019-09-08 10:29:47,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 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:29:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9300 states. [2019-09-08 10:29:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9300 to 6096. [2019-09-08 10:29:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6096 states. [2019-09-08 10:29:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6096 states to 6096 states and 8650 transitions. [2019-09-08 10:29:48,700 INFO L78 Accepts]: Start accepts. Automaton has 6096 states and 8650 transitions. Word has length 66 [2019-09-08 10:29:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:48,700 INFO L475 AbstractCegarLoop]: Abstraction has 6096 states and 8650 transitions. [2019-09-08 10:29:48,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:29:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 6096 states and 8650 transitions. [2019-09-08 10:29:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:29:48,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:48,705 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:29:48,705 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:48,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1635593437, now seen corresponding path program 1 times [2019-09-08 10:29:48,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:48,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:48,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:29:48,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:48,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:29:48,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:29:48,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:29:48,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:29:48,763 INFO L87 Difference]: Start difference. First operand 6096 states and 8650 transitions. Second operand 3 states. [2019-09-08 10:29:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:49,502 INFO L93 Difference]: Finished difference Result 13903 states and 19674 transitions. [2019-09-08 10:29:49,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:29:49,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:29:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:49,528 INFO L225 Difference]: With dead ends: 13903 [2019-09-08 10:29:49,528 INFO L226 Difference]: Without dead ends: 8937 [2019-09-08 10:29:49,541 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:29:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8937 states. [2019-09-08 10:29:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8937 to 8463. [2019-09-08 10:29:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8463 states. [2019-09-08 10:29:50,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8463 states to 8463 states and 11841 transitions. [2019-09-08 10:29:50,281 INFO L78 Accepts]: Start accepts. Automaton has 8463 states and 11841 transitions. Word has length 66 [2019-09-08 10:29:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:50,281 INFO L475 AbstractCegarLoop]: Abstraction has 8463 states and 11841 transitions. [2019-09-08 10:29:50,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:29:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8463 states and 11841 transitions. [2019-09-08 10:29:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:29:50,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:50,287 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:29:50,288 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:50,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:50,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2122429268, now seen corresponding path program 1 times [2019-09-08 10:29:50,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:50,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:50,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:50,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:50,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:29:50,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:50,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:29:50,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:29:50,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:29:50,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:29:50,379 INFO L87 Difference]: Start difference. First operand 8463 states and 11841 transitions. Second operand 3 states. [2019-09-08 10:29:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:51,371 INFO L93 Difference]: Finished difference Result 14541 states and 20200 transitions. [2019-09-08 10:29:51,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:29:51,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:29:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:51,401 INFO L225 Difference]: With dead ends: 14541 [2019-09-08 10:29:51,401 INFO L226 Difference]: Without dead ends: 8961 [2019-09-08 10:29:51,418 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:29:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8961 states. [2019-09-08 10:29:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8961 to 8604. [2019-09-08 10:29:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8604 states. [2019-09-08 10:29:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8604 states to 8604 states and 11820 transitions. [2019-09-08 10:29:52,567 INFO L78 Accepts]: Start accepts. Automaton has 8604 states and 11820 transitions. Word has length 66 [2019-09-08 10:29:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:52,567 INFO L475 AbstractCegarLoop]: Abstraction has 8604 states and 11820 transitions. [2019-09-08 10:29:52,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:29:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 8604 states and 11820 transitions. [2019-09-08 10:29:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:29:52,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:52,571 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:29:52,571 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:52,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:52,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1091113286, now seen corresponding path program 1 times [2019-09-08 10:29:52,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:52,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:52,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:52,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:52,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 10:29:52,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:52,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:29:52,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:29:52,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:29:52,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:29:52,652 INFO L87 Difference]: Start difference. First operand 8604 states and 11820 transitions. Second operand 6 states. [2019-09-08 10:29:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:54,402 INFO L93 Difference]: Finished difference Result 29103 states and 39804 transitions. [2019-09-08 10:29:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:29:54,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-09-08 10:29:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:54,451 INFO L225 Difference]: With dead ends: 29103 [2019-09-08 10:29:54,452 INFO L226 Difference]: Without dead ends: 20548 [2019-09-08 10:29:54,476 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:29:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20548 states. [2019-09-08 10:29:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20548 to 20012. [2019-09-08 10:29:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20012 states. [2019-09-08 10:29:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20012 states to 20012 states and 27258 transitions. [2019-09-08 10:29:55,843 INFO L78 Accepts]: Start accepts. Automaton has 20012 states and 27258 transitions. Word has length 66 [2019-09-08 10:29:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:55,843 INFO L475 AbstractCegarLoop]: Abstraction has 20012 states and 27258 transitions. [2019-09-08 10:29:55,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:29:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 20012 states and 27258 transitions. [2019-09-08 10:29:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:29:55,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:55,848 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:29:55,848 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:55,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:55,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1248061153, now seen corresponding path program 1 times [2019-09-08 10:29:55,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:55,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:55,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:55,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:55,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:29:55,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:29:55,931 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:29:55,946 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:29:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:56,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:29:56,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:29:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 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:29:56,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:29:56,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:29:56,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:29:56,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:29:56,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:29:56,150 INFO L87 Difference]: Start difference. First operand 20012 states and 27258 transitions. Second operand 11 states. [2019-09-08 10:30:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:00,193 INFO L93 Difference]: Finished difference Result 61385 states and 83762 transitions. [2019-09-08 10:30:00,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:30:00,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-09-08 10:30:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:00,297 INFO L225 Difference]: With dead ends: 61385 [2019-09-08 10:30:00,298 INFO L226 Difference]: Without dead ends: 45334 [2019-09-08 10:30:00,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 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:30:00,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45334 states. [2019-09-08 10:30:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45334 to 23568. [2019-09-08 10:30:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23568 states. [2019-09-08 10:30:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23568 states to 23568 states and 32167 transitions. [2019-09-08 10:30:02,101 INFO L78 Accepts]: Start accepts. Automaton has 23568 states and 32167 transitions. Word has length 66 [2019-09-08 10:30:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:02,101 INFO L475 AbstractCegarLoop]: Abstraction has 23568 states and 32167 transitions. [2019-09-08 10:30:02,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:30:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 23568 states and 32167 transitions. [2019-09-08 10:30:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:30:02,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:02,106 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:30:02,107 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:02,107 INFO L82 PathProgramCache]: Analyzing trace with hash 960704265, now seen corresponding path program 1 times [2019-09-08 10:30:02,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:02,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:02,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:02,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:02,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:02,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:02,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:02,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:02,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:02,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:02,153 INFO L87 Difference]: Start difference. First operand 23568 states and 32167 transitions. Second operand 3 states. [2019-09-08 10:30:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:04,136 INFO L93 Difference]: Finished difference Result 49978 states and 68359 transitions. [2019-09-08 10:30:04,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:04,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:30:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:04,190 INFO L225 Difference]: With dead ends: 49978 [2019-09-08 10:30:04,191 INFO L226 Difference]: Without dead ends: 30249 [2019-09-08 10:30:04,233 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:30:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30249 states. [2019-09-08 10:30:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30249 to 29482. [2019-09-08 10:30:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29482 states. [2019-09-08 10:30:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29482 states to 29482 states and 39653 transitions. [2019-09-08 10:30:06,980 INFO L78 Accepts]: Start accepts. Automaton has 29482 states and 39653 transitions. Word has length 66 [2019-09-08 10:30:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:06,980 INFO L475 AbstractCegarLoop]: Abstraction has 29482 states and 39653 transitions. [2019-09-08 10:30:06,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 29482 states and 39653 transitions. [2019-09-08 10:30:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:30:06,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:06,985 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:30:06,985 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:06,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1004582415, now seen corresponding path program 1 times [2019-09-08 10:30:06,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:06,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:06,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:06,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:06,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 10:30:07,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:07,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:30:07,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:30:07,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:30:07,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:30:07,067 INFO L87 Difference]: Start difference. First operand 29482 states and 39653 transitions. Second operand 6 states. [2019-09-08 10:30:11,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:11,814 INFO L93 Difference]: Finished difference Result 97666 states and 130763 transitions. [2019-09-08 10:30:11,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:30:11,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-09-08 10:30:11,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:11,917 INFO L225 Difference]: With dead ends: 97666 [2019-09-08 10:30:11,917 INFO L226 Difference]: Without dead ends: 68265 [2019-09-08 10:30:11,950 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:30:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68265 states. [2019-09-08 10:30:17,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68265 to 67107. [2019-09-08 10:30:17,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67107 states. [2019-09-08 10:30:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67107 states to 67107 states and 89351 transitions. [2019-09-08 10:30:18,020 INFO L78 Accepts]: Start accepts. Automaton has 67107 states and 89351 transitions. Word has length 66 [2019-09-08 10:30:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:18,021 INFO L475 AbstractCegarLoop]: Abstraction has 67107 states and 89351 transitions. [2019-09-08 10:30:18,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:30:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 67107 states and 89351 transitions. [2019-09-08 10:30:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:30:18,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:18,027 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:30:18,027 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:18,027 INFO L82 PathProgramCache]: Analyzing trace with hash 612922476, now seen corresponding path program 1 times [2019-09-08 10:30:18,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:18,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:18,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:18,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:18,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:18,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:30:18,135 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:30:18,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:18,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:30:18,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:30:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:18,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:30:18,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:30:18,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:30:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:30:18,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:30:18,349 INFO L87 Difference]: Start difference. First operand 67107 states and 89351 transitions. Second operand 11 states. [2019-09-08 10:30:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:27,028 INFO L93 Difference]: Finished difference Result 144434 states and 191276 transitions. [2019-09-08 10:30:27,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:30:27,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-09-08 10:30:27,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:27,200 INFO L225 Difference]: With dead ends: 144434 [2019-09-08 10:30:27,200 INFO L226 Difference]: Without dead ends: 110068 [2019-09-08 10:30:27,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 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:30:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110068 states. [2019-09-08 10:30:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110068 to 72679. [2019-09-08 10:30:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72679 states. [2019-09-08 10:30:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72679 states to 72679 states and 96560 transitions. [2019-09-08 10:30:34,656 INFO L78 Accepts]: Start accepts. Automaton has 72679 states and 96560 transitions. Word has length 66 [2019-09-08 10:30:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:34,656 INFO L475 AbstractCegarLoop]: Abstraction has 72679 states and 96560 transitions. [2019-09-08 10:30:34,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:30:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 72679 states and 96560 transitions. [2019-09-08 10:30:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:30:34,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:34,664 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:30:34,664 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:34,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:34,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2100475535, now seen corresponding path program 1 times [2019-09-08 10:30:34,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:34,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:34,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:34,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:34,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 10:30:34,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:34,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:30:34,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:30:34,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:30:34,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:30:34,726 INFO L87 Difference]: Start difference. First operand 72679 states and 96560 transitions. Second operand 5 states. [2019-09-08 10:30:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:44,499 INFO L93 Difference]: Finished difference Result 144600 states and 194429 transitions. [2019-09-08 10:30:44,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:30:44,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 10:30:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:44,648 INFO L225 Difference]: With dead ends: 144600 [2019-09-08 10:30:44,648 INFO L226 Difference]: Without dead ends: 112263 [2019-09-08 10:30:44,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:30:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112263 states. [2019-09-08 10:30:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112263 to 99339. [2019-09-08 10:30:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99339 states. [2019-09-08 10:30:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99339 states to 99339 states and 131606 transitions. [2019-09-08 10:30:52,504 INFO L78 Accepts]: Start accepts. Automaton has 99339 states and 131606 transitions. Word has length 68 [2019-09-08 10:30:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:52,505 INFO L475 AbstractCegarLoop]: Abstraction has 99339 states and 131606 transitions. [2019-09-08 10:30:52,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:30:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 99339 states and 131606 transitions. [2019-09-08 10:30:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:30:52,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:52,511 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:30:52,512 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1725794774, now seen corresponding path program 1 times [2019-09-08 10:30:52,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:52,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:52,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:52,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:52,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 10:30:52,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:52,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:30:52,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:30:52,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:30:52,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:30:52,577 INFO L87 Difference]: Start difference. First operand 99339 states and 131606 transitions. Second operand 5 states. [2019-09-08 10:31:04,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:04,709 INFO L93 Difference]: Finished difference Result 162533 states and 217921 transitions. [2019-09-08 10:31:04,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:31:04,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 10:31:04,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:04,892 INFO L225 Difference]: With dead ends: 162533 [2019-09-08 10:31:04,893 INFO L226 Difference]: Without dead ends: 139483 [2019-09-08 10:31:04,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:31:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139483 states. [2019-09-08 10:31:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139483 to 114889. [2019-09-08 10:31:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114889 states. [2019-09-08 10:31:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114889 states to 114889 states and 152235 transitions. [2019-09-08 10:31:14,677 INFO L78 Accepts]: Start accepts. Automaton has 114889 states and 152235 transitions. Word has length 68 [2019-09-08 10:31:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:14,678 INFO L475 AbstractCegarLoop]: Abstraction has 114889 states and 152235 transitions. [2019-09-08 10:31:14,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:31:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 114889 states and 152235 transitions. [2019-09-08 10:31:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:31:14,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:14,683 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:31:14,684 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:14,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:14,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1483121734, now seen corresponding path program 1 times [2019-09-08 10:31:14,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:14,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:14,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:14,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:14,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 10:31:14,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:31:14,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:31:14,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:31:14,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:31:14,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:31:14,747 INFO L87 Difference]: Start difference. First operand 114889 states and 152235 transitions. Second operand 5 states. [2019-09-08 10:31:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:28,937 INFO L93 Difference]: Finished difference Result 171946 states and 229639 transitions. [2019-09-08 10:31:28,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:31:28,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 10:31:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:29,139 INFO L225 Difference]: With dead ends: 171946 [2019-09-08 10:31:29,139 INFO L226 Difference]: Without dead ends: 151626 [2019-09-08 10:31:29,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:31:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151626 states. [2019-09-08 10:31:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151626 to 134503. [2019-09-08 10:31:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134503 states. [2019-09-08 10:31:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134503 states to 134503 states and 178183 transitions. [2019-09-08 10:31:39,994 INFO L78 Accepts]: Start accepts. Automaton has 134503 states and 178183 transitions. Word has length 68 [2019-09-08 10:31:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:39,994 INFO L475 AbstractCegarLoop]: Abstraction has 134503 states and 178183 transitions. [2019-09-08 10:31:39,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:31:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 134503 states and 178183 transitions. [2019-09-08 10:31:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:31:40,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:40,002 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:31:40,002 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:40,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:40,002 INFO L82 PathProgramCache]: Analyzing trace with hash 8068845, now seen corresponding path program 1 times [2019-09-08 10:31:40,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:40,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:40,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:40,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:40,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:31:40,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:31:40,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:31:40,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:40,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 10:31:40,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:31:41,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:31:41,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:31:41,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:31:41,398 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-08 10:31:41,974 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-08 10:31:41,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:31:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:31:42,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:31:42,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24] total 31 [2019-09-08 10:31:42,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 10:31:42,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 10:31:42,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2019-09-08 10:31:42,590 INFO L87 Difference]: Start difference. First operand 134503 states and 178183 transitions. Second operand 31 states. [2019-09-08 10:31:45,255 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 10:31:45,584 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 10:31:45,932 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-08 10:31:46,555 WARN L188 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 10:31:47,171 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-08 10:31:47,555 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 10:31:47,863 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-08 10:31:48,213 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-08 10:31:48,825 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-08 10:31:49,317 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-09-08 10:31:49,641 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-08 10:31:50,273 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-09-08 10:31:50,539 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-08 10:31:50,781 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 10:31:50,973 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 10:31:51,462 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 10:31:51,844 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-08 10:31:53,293 WARN L188 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-08 10:31:53,578 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 10:31:53,961 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 10:31:54,144 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-08 10:31:55,275 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-08 10:31:55,579 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-08 10:31:55,883 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 10:31:56,277 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 10:31:56,576 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 10:31:56,966 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 10:31:57,102 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 10:31:57,485 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-08 10:31:58,664 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 10:31:58,962 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-08 10:31:59,901 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-08 10:32:00,192 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-08 10:32:00,495 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-08 10:32:00,766 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-08 10:32:01,135 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 10:32:01,460 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-08 10:32:01,689 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-08 10:32:02,686 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-08 10:32:03,053 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 10:32:03,498 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 10:32:03,925 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-08 10:32:04,219 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 10:32:04,400 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-08 10:32:05,522 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-08 10:32:06,103 WARN L188 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-08 10:32:06,466 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-08 10:32:06,949 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-08 10:32:08,113 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-08 10:32:08,421 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-08 10:32:08,848 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-08 10:32:09,768 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-08 10:32:14,237 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-08 10:32:15,558 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-09-08 10:32:16,233 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 10:32:16,550 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 10:32:17,684 WARN L188 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-08 10:32:18,090 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-08 10:32:18,719 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-08 10:32:26,728 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-08 10:32:28,722 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-08 10:32:29,352 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-08 10:32:33,576 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-08 10:32:33,911 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-08 10:32:35,937 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-08 10:32:36,203 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 10:32:37,717 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 10:32:38,182 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 10:32:40,175 WARN L188 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-08 10:32:40,575 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 10:32:40,896 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-08 10:32:41,123 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 10:32:42,710 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 10:32:43,138 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-08 10:32:43,406 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-08 10:32:43,580 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 10:32:43,998 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-09-08 10:32:44,696 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 10:32:45,112 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 10:32:45,454 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-08 10:32:46,362 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-08 10:32:46,742 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-08 10:32:47,006 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 10:32:48,403 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-08 10:32:48,756 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-08 10:32:48,924 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 10:32:49,783 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-08 10:35:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:21,252 INFO L93 Difference]: Finished difference Result 1495758 states and 1961283 transitions. [2019-09-08 10:35:21,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 338 states. [2019-09-08 10:35:21,253 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 73 [2019-09-08 10:35:21,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:23,679 INFO L225 Difference]: With dead ends: 1495758 [2019-09-08 10:35:23,679 INFO L226 Difference]: Without dead ends: 1361040 [2019-09-08 10:35:24,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61263 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=20298, Invalid=109662, Unknown=0, NotChecked=0, Total=129960 [2019-09-08 10:35:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361040 states. [2019-09-08 10:36:46,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361040 to 445889. [2019-09-08 10:36:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445889 states. [2019-09-08 10:36:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445889 states to 445889 states and 590673 transitions. [2019-09-08 10:36:47,759 INFO L78 Accepts]: Start accepts. Automaton has 445889 states and 590673 transitions. Word has length 73 [2019-09-08 10:36:47,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:47,759 INFO L475 AbstractCegarLoop]: Abstraction has 445889 states and 590673 transitions. [2019-09-08 10:36:47,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 10:36:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand 445889 states and 590673 transitions. [2019-09-08 10:36:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:36:47,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:47,773 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:36:47,773 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:47,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:47,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1128636889, now seen corresponding path program 1 times [2019-09-08 10:36:47,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:47,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:47,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:47,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:47,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 10:36:47,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:47,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:47,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:47,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:47,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:47,818 INFO L87 Difference]: Start difference. First operand 445889 states and 590673 transitions. Second operand 3 states. [2019-09-08 10:37:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:41,765 INFO L93 Difference]: Finished difference Result 841300 states and 1115579 transitions. [2019-09-08 10:37:41,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:41,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:37:41,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:42,391 INFO L225 Difference]: With dead ends: 841300 [2019-09-08 10:37:42,391 INFO L226 Difference]: Without dead ends: 397639 [2019-09-08 10:37:42,645 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:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397639 states. [2019-09-08 10:38:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397639 to 395274. [2019-09-08 10:38:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395274 states. [2019-09-08 10:38:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395274 states to 395274 states and 519374 transitions. [2019-09-08 10:38:38,439 INFO L78 Accepts]: Start accepts. Automaton has 395274 states and 519374 transitions. Word has length 74 [2019-09-08 10:38:38,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:38,440 INFO L475 AbstractCegarLoop]: Abstraction has 395274 states and 519374 transitions. [2019-09-08 10:38:38,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:38:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 395274 states and 519374 transitions. [2019-09-08 10:38:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:38:38,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:38,450 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] [2019-09-08 10:38:38,450 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:38,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:38,450 INFO L82 PathProgramCache]: Analyzing trace with hash -174967646, now seen corresponding path program 1 times [2019-09-08 10:38:38,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:38,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:38,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:38,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:38,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:38,492 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:38:38,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:38,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:38:38,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:38:38,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:38:38,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:38:38,494 INFO L87 Difference]: Start difference. First operand 395274 states and 519374 transitions. Second operand 3 states. [2019-09-08 10:39:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:25,804 INFO L93 Difference]: Finished difference Result 485559 states and 636498 transitions. [2019-09-08 10:39:25,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:39:25,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:39:25,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:26,392 INFO L225 Difference]: With dead ends: 485559 [2019-09-08 10:39:26,392 INFO L226 Difference]: Without dead ends: 358254 [2019-09-08 10:39:26,519 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:39:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358254 states. [2019-09-08 10:40:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358254 to 297335. [2019-09-08 10:40:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297335 states. [2019-09-08 10:40:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297335 states to 297335 states and 385182 transitions. [2019-09-08 10:40:10,845 INFO L78 Accepts]: Start accepts. Automaton has 297335 states and 385182 transitions. Word has length 74 [2019-09-08 10:40:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:10,845 INFO L475 AbstractCegarLoop]: Abstraction has 297335 states and 385182 transitions. [2019-09-08 10:40:10,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:40:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 297335 states and 385182 transitions. [2019-09-08 10:40:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:40:10,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:10,852 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:40:10,853 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:10,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:10,853 INFO L82 PathProgramCache]: Analyzing trace with hash -904394025, now seen corresponding path program 1 times [2019-09-08 10:40:10,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:10,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:10,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:10,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:10,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:40:10,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:10,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:40:10,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:40:10,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:40:10,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:40:10,894 INFO L87 Difference]: Start difference. First operand 297335 states and 385182 transitions. Second operand 3 states. [2019-09-08 10:40:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:53,833 INFO L93 Difference]: Finished difference Result 594425 states and 771648 transitions. [2019-09-08 10:40:53,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:40:53,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:40:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:54,266 INFO L225 Difference]: With dead ends: 594425 [2019-09-08 10:40:54,267 INFO L226 Difference]: Without dead ends: 297148 [2019-09-08 10:40:54,453 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:40:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297148 states.