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_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:37:59,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:37:59,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:37:59,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:37:59,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:37:59,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:37:59,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:37:59,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:37:59,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:37:59,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:37:59,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:37:59,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:37:59,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:37:59,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:37:59,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:37:59,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:37:59,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:37:59,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:37:59,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:37:59,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:37:59,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:37:59,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:37:59,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:37:59,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:37:59,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:37:59,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:37:59,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:37:59,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:37:59,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:37:59,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:37:59,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:37:59,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:37:59,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:37:59,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:37:59,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:37:59,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:37:59,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:37:59,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:37:59,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:37:59,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:37:59,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:37:59,247 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 09:37:59,261 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:37:59,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:37:59,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:37:59,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:37:59,262 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:37:59,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:37:59,263 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:37:59,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:37:59,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:37:59,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:37:59,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:37:59,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:37:59,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:37:59,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:37:59,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:37:59,265 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:37:59,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:37:59,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:37:59,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:37:59,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:37:59,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:37:59,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:37:59,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:37:59,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:37:59,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:37:59,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:37:59,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:37:59,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:37:59,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:37:59,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:37:59,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:37:59,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:37:59,315 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:37:59,316 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:37:59,316 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 09:37:59,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45cfb170/40f5fb3c9d8b4d19ab5cd0c56678142c/FLAG829eacc85 [2019-09-08 09:37:59,945 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:37:59,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 09:37:59,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45cfb170/40f5fb3c9d8b4d19ab5cd0c56678142c/FLAG829eacc85 [2019-09-08 09:38:00,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45cfb170/40f5fb3c9d8b4d19ab5cd0c56678142c [2019-09-08 09:38:00,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:38:00,253 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:38:00,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:38:00,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:38:00,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:38:00,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:38:00" (1/1) ... [2019-09-08 09:38:00,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c490221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:00, skipping insertion in model container [2019-09-08 09:38:00,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:38:00" (1/1) ... [2019-09-08 09:38:00,270 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:38:00,326 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:38:00,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:38:00,687 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:38:00,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:38:00,852 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:38:00,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:00 WrapperNode [2019-09-08 09:38:00,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:38:00,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:38:00,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:38:00,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:38:00,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:00" (1/1) ... [2019-09-08 09:38:00,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:00" (1/1) ... [2019-09-08 09:38:00,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:00" (1/1) ... [2019-09-08 09:38:00,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:00" (1/1) ... [2019-09-08 09:38:00,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:00" (1/1) ... [2019-09-08 09:38:00,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:00" (1/1) ... [2019-09-08 09:38:00,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:00" (1/1) ... [2019-09-08 09:38:00,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:38:00,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:38:00,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:38:00,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:38:00,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:00" (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 09:38:00,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:38:00,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:38:00,994 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:38:00,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:38:00,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:38:00,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:38:00,994 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:38:00,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:38:00,995 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:38:00,995 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:38:00,995 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:38:00,995 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:38:00,995 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:38:00,996 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:38:00,996 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:38:00,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:38:00,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:38:00,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:38:01,802 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:38:01,803 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:38:01,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:38:01 BoogieIcfgContainer [2019-09-08 09:38:01,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:38:01,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:38:01,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:38:01,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:38:01,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:38:00" (1/3) ... [2019-09-08 09:38:01,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b96545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:38:01, skipping insertion in model container [2019-09-08 09:38:01,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:00" (2/3) ... [2019-09-08 09:38:01,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b96545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:38:01, skipping insertion in model container [2019-09-08 09:38:01,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:38:01" (3/3) ... [2019-09-08 09:38:01,814 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 09:38:01,829 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:38:01,850 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:38:01,869 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:38:01,897 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:38:01,898 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:38:01,898 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:38:01,898 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:38:01,899 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:38:01,899 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:38:01,899 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:38:01,899 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:38:01,899 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:38:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-08 09:38:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 09:38:01,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:01,931 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:01,933 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:01,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:01,939 INFO L82 PathProgramCache]: Analyzing trace with hash 8502252, now seen corresponding path program 1 times [2019-09-08 09:38:01,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:01,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:02,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:02,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:02,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:02,350 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 09:38:02,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:02,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:02,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:02,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:02,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:02,393 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-08 09:38:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:02,570 INFO L93 Difference]: Finished difference Result 295 states and 498 transitions. [2019-09-08 09:38:02,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:02,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 09:38:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:02,596 INFO L225 Difference]: With dead ends: 295 [2019-09-08 09:38:02,596 INFO L226 Difference]: Without dead ends: 205 [2019-09-08 09:38:02,604 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 09:38:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-08 09:38:02,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2019-09-08 09:38:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-08 09:38:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 317 transitions. [2019-09-08 09:38:02,719 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 317 transitions. Word has length 61 [2019-09-08 09:38:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:02,719 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 317 transitions. [2019-09-08 09:38:02,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 317 transitions. [2019-09-08 09:38:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 09:38:02,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:02,724 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:02,724 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash -851487175, now seen corresponding path program 1 times [2019-09-08 09:38:02,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:02,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:02,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:02,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:02,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:02,918 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 09:38:02,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:02,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:02,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:02,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:02,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:02,922 INFO L87 Difference]: Start difference. First operand 203 states and 317 transitions. Second operand 3 states. [2019-09-08 09:38:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:02,992 INFO L93 Difference]: Finished difference Result 479 states and 773 transitions. [2019-09-08 09:38:02,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:02,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 09:38:02,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:02,996 INFO L225 Difference]: With dead ends: 479 [2019-09-08 09:38:02,996 INFO L226 Difference]: Without dead ends: 334 [2019-09-08 09:38:03,000 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 09:38:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-08 09:38:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-09-08 09:38:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-08 09:38:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 529 transitions. [2019-09-08 09:38:03,030 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 529 transitions. Word has length 63 [2019-09-08 09:38:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:03,030 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 529 transitions. [2019-09-08 09:38:03,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 529 transitions. [2019-09-08 09:38:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 09:38:03,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:03,034 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:03,034 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:03,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:03,035 INFO L82 PathProgramCache]: Analyzing trace with hash 812724513, now seen corresponding path program 1 times [2019-09-08 09:38:03,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:03,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:03,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:03,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:03,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:03,174 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 09:38:03,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:03,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:03,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:03,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:03,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:03,176 INFO L87 Difference]: Start difference. First operand 332 states and 529 transitions. Second operand 3 states. [2019-09-08 09:38:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:03,227 INFO L93 Difference]: Finished difference Result 607 states and 985 transitions. [2019-09-08 09:38:03,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:03,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 09:38:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:03,231 INFO L225 Difference]: With dead ends: 607 [2019-09-08 09:38:03,231 INFO L226 Difference]: Without dead ends: 462 [2019-09-08 09:38:03,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 09:38:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-08 09:38:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2019-09-08 09:38:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 09:38:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 739 transitions. [2019-09-08 09:38:03,265 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 739 transitions. Word has length 65 [2019-09-08 09:38:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:03,266 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 739 transitions. [2019-09-08 09:38:03,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 739 transitions. [2019-09-08 09:38:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 09:38:03,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:03,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:03,269 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:03,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1750058316, now seen corresponding path program 1 times [2019-09-08 09:38:03,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:03,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:03,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:03,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:03,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:03,346 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 09:38:03,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:03,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:03,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:03,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:03,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:03,348 INFO L87 Difference]: Start difference. First operand 460 states and 739 transitions. Second operand 3 states. [2019-09-08 09:38:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:03,419 INFO L93 Difference]: Finished difference Result 1176 states and 1915 transitions. [2019-09-08 09:38:03,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:03,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 09:38:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:03,425 INFO L225 Difference]: With dead ends: 1176 [2019-09-08 09:38:03,426 INFO L226 Difference]: Without dead ends: 797 [2019-09-08 09:38:03,428 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 09:38:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-09-08 09:38:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 795. [2019-09-08 09:38:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-09-08 09:38:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1281 transitions. [2019-09-08 09:38:03,479 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1281 transitions. Word has length 65 [2019-09-08 09:38:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:03,481 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1281 transitions. [2019-09-08 09:38:03,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1281 transitions. [2019-09-08 09:38:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 09:38:03,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:03,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:03,491 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:03,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:03,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1895724377, now seen corresponding path program 1 times [2019-09-08 09:38:03,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:03,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:03,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:03,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:03,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:03,682 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 09:38:03,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:03,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:38:03,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:38:03,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:38:03,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:38:03,687 INFO L87 Difference]: Start difference. First operand 795 states and 1281 transitions. Second operand 5 states. [2019-09-08 09:38:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:03,938 INFO L93 Difference]: Finished difference Result 2733 states and 4488 transitions. [2019-09-08 09:38:03,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:38:03,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-08 09:38:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:03,951 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 09:38:03,952 INFO L226 Difference]: Without dead ends: 2019 [2019-09-08 09:38:03,955 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 09:38:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-09-08 09:38:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1761. [2019-09-08 09:38:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-09-08 09:38:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2868 transitions. [2019-09-08 09:38:04,072 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2868 transitions. Word has length 67 [2019-09-08 09:38:04,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:04,074 INFO L475 AbstractCegarLoop]: Abstraction has 1761 states and 2868 transitions. [2019-09-08 09:38:04,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:38:04,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2868 transitions. [2019-09-08 09:38:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:38:04,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:04,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:04,076 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:04,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:04,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1423696929, now seen corresponding path program 1 times [2019-09-08 09:38:04,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:04,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:04,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:04,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:04,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:04,222 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 09:38:04,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:04,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:38:04,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:38:04,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:38:04,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:38:04,226 INFO L87 Difference]: Start difference. First operand 1761 states and 2868 transitions. Second operand 6 states. [2019-09-08 09:38:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:04,671 INFO L93 Difference]: Finished difference Result 6678 states and 10958 transitions. [2019-09-08 09:38:04,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:38:04,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-08 09:38:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:04,698 INFO L225 Difference]: With dead ends: 6678 [2019-09-08 09:38:04,699 INFO L226 Difference]: Without dead ends: 5000 [2019-09-08 09:38:04,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:38:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5000 states. [2019-09-08 09:38:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5000 to 4931. [2019-09-08 09:38:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4931 states. [2019-09-08 09:38:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4931 states to 4931 states and 8050 transitions. [2019-09-08 09:38:05,051 INFO L78 Accepts]: Start accepts. Automaton has 4931 states and 8050 transitions. Word has length 68 [2019-09-08 09:38:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:05,052 INFO L475 AbstractCegarLoop]: Abstraction has 4931 states and 8050 transitions. [2019-09-08 09:38:05,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:38:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4931 states and 8050 transitions. [2019-09-08 09:38:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:38:05,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:05,054 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:05,054 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:05,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:05,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1771341997, now seen corresponding path program 1 times [2019-09-08 09:38:05,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:05,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:05,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:05,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:05,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:05,132 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 09:38:05,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:05,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:05,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:05,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:05,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:05,135 INFO L87 Difference]: Start difference. First operand 4931 states and 8050 transitions. Second operand 3 states. [2019-09-08 09:38:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:05,460 INFO L93 Difference]: Finished difference Result 9889 states and 16204 transitions. [2019-09-08 09:38:05,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:05,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 09:38:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:05,499 INFO L225 Difference]: With dead ends: 9889 [2019-09-08 09:38:05,499 INFO L226 Difference]: Without dead ends: 6705 [2019-09-08 09:38:05,511 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 09:38:05,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2019-09-08 09:38:05,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 6703. [2019-09-08 09:38:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6703 states. [2019-09-08 09:38:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6703 states to 6703 states and 10897 transitions. [2019-09-08 09:38:05,923 INFO L78 Accepts]: Start accepts. Automaton has 6703 states and 10897 transitions. Word has length 68 [2019-09-08 09:38:05,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:05,923 INFO L475 AbstractCegarLoop]: Abstraction has 6703 states and 10897 transitions. [2019-09-08 09:38:05,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6703 states and 10897 transitions. [2019-09-08 09:38:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:38:05,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:05,925 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:05,926 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:05,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:05,927 INFO L82 PathProgramCache]: Analyzing trace with hash 334558445, now seen corresponding path program 1 times [2019-09-08 09:38:05,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:05,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:05,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:05,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:05,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:05,979 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 09:38:05,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:05,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:05,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:05,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:05,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:05,980 INFO L87 Difference]: Start difference. First operand 6703 states and 10897 transitions. Second operand 3 states. [2019-09-08 09:38:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:06,527 INFO L93 Difference]: Finished difference Result 14965 states and 24539 transitions. [2019-09-08 09:38:06,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:06,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 09:38:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:06,589 INFO L225 Difference]: With dead ends: 14965 [2019-09-08 09:38:06,589 INFO L226 Difference]: Without dead ends: 9919 [2019-09-08 09:38:06,606 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 09:38:06,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9919 states. [2019-09-08 09:38:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9919 to 9917. [2019-09-08 09:38:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9917 states. [2019-09-08 09:38:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9917 states to 9917 states and 16099 transitions. [2019-09-08 09:38:07,222 INFO L78 Accepts]: Start accepts. Automaton has 9917 states and 16099 transitions. Word has length 68 [2019-09-08 09:38:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:07,223 INFO L475 AbstractCegarLoop]: Abstraction has 9917 states and 16099 transitions. [2019-09-08 09:38:07,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 9917 states and 16099 transitions. [2019-09-08 09:38:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:38:07,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:07,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:07,224 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:07,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:07,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1241984288, now seen corresponding path program 1 times [2019-09-08 09:38:07,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:07,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:07,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:07,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:07,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:07,311 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 09:38:07,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:07,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:07,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:07,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:07,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:07,313 INFO L87 Difference]: Start difference. First operand 9917 states and 16099 transitions. Second operand 4 states. [2019-09-08 09:38:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:08,002 INFO L93 Difference]: Finished difference Result 25315 states and 41189 transitions. [2019-09-08 09:38:08,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:38:08,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-08 09:38:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:08,045 INFO L225 Difference]: With dead ends: 25315 [2019-09-08 09:38:08,045 INFO L226 Difference]: Without dead ends: 15484 [2019-09-08 09:38:08,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15484 states. [2019-09-08 09:38:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15484 to 15417. [2019-09-08 09:38:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15417 states. [2019-09-08 09:38:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15417 states to 15417 states and 24955 transitions. [2019-09-08 09:38:09,441 INFO L78 Accepts]: Start accepts. Automaton has 15417 states and 24955 transitions. Word has length 69 [2019-09-08 09:38:09,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:09,442 INFO L475 AbstractCegarLoop]: Abstraction has 15417 states and 24955 transitions. [2019-09-08 09:38:09,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:38:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 15417 states and 24955 transitions. [2019-09-08 09:38:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 09:38:09,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:09,443 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:09,444 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:09,444 INFO L82 PathProgramCache]: Analyzing trace with hash 100698310, now seen corresponding path program 1 times [2019-09-08 09:38:09,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:09,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:09,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:09,521 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 09:38:09,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:09,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:09,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:09,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:09,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:09,523 INFO L87 Difference]: Start difference. First operand 15417 states and 24955 transitions. Second operand 4 states. [2019-09-08 09:38:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:10,398 INFO L93 Difference]: Finished difference Result 45538 states and 73914 transitions. [2019-09-08 09:38:10,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:38:10,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-09-08 09:38:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:10,489 INFO L225 Difference]: With dead ends: 45538 [2019-09-08 09:38:10,489 INFO L226 Difference]: Without dead ends: 30207 [2019-09-08 09:38:10,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:38:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30207 states. [2019-09-08 09:38:11,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30207 to 22725. [2019-09-08 09:38:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-09-08 09:38:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 36691 transitions. [2019-09-08 09:38:11,850 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 36691 transitions. Word has length 70 [2019-09-08 09:38:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:11,850 INFO L475 AbstractCegarLoop]: Abstraction has 22725 states and 36691 transitions. [2019-09-08 09:38:11,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:38:11,851 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 36691 transitions. [2019-09-08 09:38:11,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 09:38:11,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:11,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:11,853 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:11,853 INFO L82 PathProgramCache]: Analyzing trace with hash 792159510, now seen corresponding path program 1 times [2019-09-08 09:38:11,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:11,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:11,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:11,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:11,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:12,010 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 09:38:12,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:12,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:38:12,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:38:12,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:38:12,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:38:12,012 INFO L87 Difference]: Start difference. First operand 22725 states and 36691 transitions. Second operand 5 states. [2019-09-08 09:38:12,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:12,981 INFO L93 Difference]: Finished difference Result 47072 states and 76081 transitions. [2019-09-08 09:38:12,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:38:12,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 09:38:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:13,058 INFO L225 Difference]: With dead ends: 47072 [2019-09-08 09:38:13,058 INFO L226 Difference]: Without dead ends: 24433 [2019-09-08 09:38:13,114 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 09:38:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24433 states. [2019-09-08 09:38:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24433 to 22725. [2019-09-08 09:38:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-09-08 09:38:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 36556 transitions. [2019-09-08 09:38:14,954 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 36556 transitions. Word has length 72 [2019-09-08 09:38:14,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:14,954 INFO L475 AbstractCegarLoop]: Abstraction has 22725 states and 36556 transitions. [2019-09-08 09:38:14,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:38:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 36556 transitions. [2019-09-08 09:38:14,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 09:38:14,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:14,956 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:14,956 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:14,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:14,956 INFO L82 PathProgramCache]: Analyzing trace with hash 624122737, now seen corresponding path program 1 times [2019-09-08 09:38:14,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:14,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:14,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:14,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:14,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:15,090 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 09:38:15,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:15,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:38:15,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:38:15,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:38:15,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:38:15,092 INFO L87 Difference]: Start difference. First operand 22725 states and 36556 transitions. Second operand 5 states. [2019-09-08 09:38:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:16,276 INFO L93 Difference]: Finished difference Result 64027 states and 103196 transitions. [2019-09-08 09:38:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:38:16,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 09:38:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:16,361 INFO L225 Difference]: With dead ends: 64027 [2019-09-08 09:38:16,361 INFO L226 Difference]: Without dead ends: 41388 [2019-09-08 09:38:16,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:38:16,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41388 states. [2019-09-08 09:38:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41388 to 41386. [2019-09-08 09:38:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41386 states. [2019-09-08 09:38:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41386 states to 41386 states and 66190 transitions. [2019-09-08 09:38:17,973 INFO L78 Accepts]: Start accepts. Automaton has 41386 states and 66190 transitions. Word has length 75 [2019-09-08 09:38:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:17,973 INFO L475 AbstractCegarLoop]: Abstraction has 41386 states and 66190 transitions. [2019-09-08 09:38:17,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:38:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 41386 states and 66190 transitions. [2019-09-08 09:38:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 09:38:17,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:17,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:17,975 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:17,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:17,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2128940941, now seen corresponding path program 1 times [2019-09-08 09:38:17,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:17,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:17,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:17,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:17,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:18,082 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 09:38:18,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:18,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:38:18,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:38:18,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:38:18,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:38:18,084 INFO L87 Difference]: Start difference. First operand 41386 states and 66190 transitions. Second operand 5 states. [2019-09-08 09:38:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:20,708 INFO L93 Difference]: Finished difference Result 72836 states and 115824 transitions. [2019-09-08 09:38:20,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:38:20,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 09:38:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:20,907 INFO L225 Difference]: With dead ends: 72836 [2019-09-08 09:38:20,907 INFO L226 Difference]: Without dead ends: 72834 [2019-09-08 09:38:20,935 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 09:38:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72834 states. [2019-09-08 09:38:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72834 to 42462. [2019-09-08 09:38:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42462 states. [2019-09-08 09:38:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42462 states to 42462 states and 67257 transitions. [2019-09-08 09:38:22,905 INFO L78 Accepts]: Start accepts. Automaton has 42462 states and 67257 transitions. Word has length 76 [2019-09-08 09:38:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:22,905 INFO L475 AbstractCegarLoop]: Abstraction has 42462 states and 67257 transitions. [2019-09-08 09:38:22,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:38:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 42462 states and 67257 transitions. [2019-09-08 09:38:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:38:22,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:22,911 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:22,912 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:22,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:22,912 INFO L82 PathProgramCache]: Analyzing trace with hash -294350133, now seen corresponding path program 1 times [2019-09-08 09:38:22,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:22,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:22,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:22,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:22,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:38:23,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:23,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:23,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:23,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:23,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:23,100 INFO L87 Difference]: Start difference. First operand 42462 states and 67257 transitions. Second operand 4 states. [2019-09-08 09:38:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:25,656 INFO L93 Difference]: Finished difference Result 89615 states and 142839 transitions. [2019-09-08 09:38:25,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:38:25,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-08 09:38:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:25,835 INFO L225 Difference]: With dead ends: 89615 [2019-09-08 09:38:25,835 INFO L226 Difference]: Without dead ends: 69547 [2019-09-08 09:38:25,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:38:25,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69547 states. [2019-09-08 09:38:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69547 to 61175. [2019-09-08 09:38:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61175 states. [2019-09-08 09:38:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61175 states to 61175 states and 97106 transitions. [2019-09-08 09:38:29,714 INFO L78 Accepts]: Start accepts. Automaton has 61175 states and 97106 transitions. Word has length 97 [2019-09-08 09:38:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:29,714 INFO L475 AbstractCegarLoop]: Abstraction has 61175 states and 97106 transitions. [2019-09-08 09:38:29,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:38:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 61175 states and 97106 transitions. [2019-09-08 09:38:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:38:29,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:29,716 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:29,716 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:29,716 INFO L82 PathProgramCache]: Analyzing trace with hash -266072244, now seen corresponding path program 1 times [2019-09-08 09:38:29,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:29,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:29,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:29,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:29,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:29,780 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 09:38:29,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:29,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:29,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:29,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:29,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:29,782 INFO L87 Difference]: Start difference. First operand 61175 states and 97106 transitions. Second operand 3 states. [2019-09-08 09:38:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:32,104 INFO L93 Difference]: Finished difference Result 113765 states and 181202 transitions. [2019-09-08 09:38:32,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:32,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 09:38:32,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:32,210 INFO L225 Difference]: With dead ends: 113765 [2019-09-08 09:38:32,211 INFO L226 Difference]: Without dead ends: 52676 [2019-09-08 09:38:32,282 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 09:38:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52676 states. [2019-09-08 09:38:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52676 to 52670. [2019-09-08 09:38:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52670 states. [2019-09-08 09:38:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52670 states to 52670 states and 83620 transitions. [2019-09-08 09:38:36,374 INFO L78 Accepts]: Start accepts. Automaton has 52670 states and 83620 transitions. Word has length 97 [2019-09-08 09:38:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:36,375 INFO L475 AbstractCegarLoop]: Abstraction has 52670 states and 83620 transitions. [2019-09-08 09:38:36,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 52670 states and 83620 transitions. [2019-09-08 09:38:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:38:36,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:36,377 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:36,377 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:36,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1440233355, now seen corresponding path program 1 times [2019-09-08 09:38:36,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:36,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:36,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:36,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:36,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 09:38:36,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:36,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:36,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:36,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:36,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:36,531 INFO L87 Difference]: Start difference. First operand 52670 states and 83620 transitions. Second operand 4 states. [2019-09-08 09:38:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:40,206 INFO L93 Difference]: Finished difference Result 113589 states and 181542 transitions. [2019-09-08 09:38:40,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:38:40,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-08 09:38:40,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:40,338 INFO L225 Difference]: With dead ends: 113589 [2019-09-08 09:38:40,339 INFO L226 Difference]: Without dead ends: 88403 [2019-09-08 09:38:40,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:38:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88403 states. [2019-09-08 09:38:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88403 to 77817. [2019-09-08 09:38:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77817 states. [2019-09-08 09:38:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77817 states to 77817 states and 123837 transitions. [2019-09-08 09:38:43,972 INFO L78 Accepts]: Start accepts. Automaton has 77817 states and 123837 transitions. Word has length 97 [2019-09-08 09:38:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:43,972 INFO L475 AbstractCegarLoop]: Abstraction has 77817 states and 123837 transitions. [2019-09-08 09:38:43,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:38:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 77817 states and 123837 transitions. [2019-09-08 09:38:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:38:43,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:43,974 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:43,974 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:43,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:43,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1991425558, now seen corresponding path program 1 times [2019-09-08 09:38:43,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:43,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:43,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:43,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:43,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:38:44,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:44,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:38:44,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:38:44,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:38:44,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:38:44,074 INFO L87 Difference]: Start difference. First operand 77817 states and 123837 transitions. Second operand 5 states. [2019-09-08 09:38:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:49,846 INFO L93 Difference]: Finished difference Result 146981 states and 234392 transitions. [2019-09-08 09:38:49,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:38:49,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 09:38:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:50,008 INFO L225 Difference]: With dead ends: 146981 [2019-09-08 09:38:50,008 INFO L226 Difference]: Without dead ends: 104046 [2019-09-08 09:38:50,057 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 09:38:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104046 states. [2019-09-08 09:38:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104046 to 102313. [2019-09-08 09:38:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102313 states. [2019-09-08 09:38:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102313 states to 102313 states and 162324 transitions. [2019-09-08 09:38:57,310 INFO L78 Accepts]: Start accepts. Automaton has 102313 states and 162324 transitions. Word has length 97 [2019-09-08 09:38:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:57,311 INFO L475 AbstractCegarLoop]: Abstraction has 102313 states and 162324 transitions. [2019-09-08 09:38:57,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:38:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 102313 states and 162324 transitions. [2019-09-08 09:38:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 09:38:57,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:57,313 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:57,313 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:57,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:57,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1914840343, now seen corresponding path program 1 times [2019-09-08 09:38:57,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:57,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:57,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:57,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:57,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:38:57,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:57,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:57,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:57,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:57,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:57,402 INFO L87 Difference]: Start difference. First operand 102313 states and 162324 transitions. Second operand 3 states. [2019-09-08 09:39:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:08,209 INFO L93 Difference]: Finished difference Result 279757 states and 444474 transitions. [2019-09-08 09:39:08,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:08,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 09:39:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:08,493 INFO L225 Difference]: With dead ends: 279757 [2019-09-08 09:39:08,493 INFO L226 Difference]: Without dead ends: 186124 [2019-09-08 09:39:08,575 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 09:39:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186124 states. [2019-09-08 09:39:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186124 to 185809. [2019-09-08 09:39:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185809 states. [2019-09-08 09:39:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185809 states to 185809 states and 294600 transitions. [2019-09-08 09:39:17,347 INFO L78 Accepts]: Start accepts. Automaton has 185809 states and 294600 transitions. Word has length 98 [2019-09-08 09:39:17,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:17,347 INFO L475 AbstractCegarLoop]: Abstraction has 185809 states and 294600 transitions. [2019-09-08 09:39:17,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 185809 states and 294600 transitions. [2019-09-08 09:39:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:39:17,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:17,349 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:39:17,349 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:17,349 INFO L82 PathProgramCache]: Analyzing trace with hash 587107172, now seen corresponding path program 1 times [2019-09-08 09:39:17,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:17,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:17,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:17,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:17,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:39:17,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:17,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:17,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:17,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:17,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:17,406 INFO L87 Difference]: Start difference. First operand 185809 states and 294600 transitions. Second operand 3 states. [2019-09-08 09:39:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:37,438 INFO L93 Difference]: Finished difference Result 546835 states and 866907 transitions. [2019-09-08 09:39:37,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:37,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 09:39:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:38,035 INFO L225 Difference]: With dead ends: 546835 [2019-09-08 09:39:38,035 INFO L226 Difference]: Without dead ends: 361114 [2019-09-08 09:39:38,201 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 09:39:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361114 states. [2019-09-08 09:40:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361114 to 361112. [2019-09-08 09:40:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361112 states. [2019-09-08 09:40:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361112 states to 361112 states and 568277 transitions. [2019-09-08 09:40:06,173 INFO L78 Accepts]: Start accepts. Automaton has 361112 states and 568277 transitions. Word has length 99 [2019-09-08 09:40:06,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:06,173 INFO L475 AbstractCegarLoop]: Abstraction has 361112 states and 568277 transitions. [2019-09-08 09:40:06,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 361112 states and 568277 transitions. [2019-09-08 09:40:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:40:06,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:06,176 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:06,176 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:06,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:06,176 INFO L82 PathProgramCache]: Analyzing trace with hash -133241042, now seen corresponding path program 1 times [2019-09-08 09:40:06,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:06,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:06,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:06,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:06,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:40:06,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:06,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:06,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:06,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:06,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:06,254 INFO L87 Difference]: Start difference. First operand 361112 states and 568277 transitions. Second operand 3 states. [2019-09-08 09:40:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:55,959 INFO L93 Difference]: Finished difference Result 1060340 states and 1668323 transitions. [2019-09-08 09:40:55,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:55,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 09:40:55,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:57,167 INFO L225 Difference]: With dead ends: 1060340 [2019-09-08 09:40:57,167 INFO L226 Difference]: Without dead ends: 699361 [2019-09-08 09:40:57,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 09:40:57,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699361 states. [2019-09-08 09:41:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699361 to 699359. [2019-09-08 09:41:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699359 states. [2019-09-08 09:41:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699359 states to 699359 states and 1091459 transitions. [2019-09-08 09:41:53,025 INFO L78 Accepts]: Start accepts. Automaton has 699359 states and 1091459 transitions. Word has length 99 [2019-09-08 09:41:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:53,025 INFO L475 AbstractCegarLoop]: Abstraction has 699359 states and 1091459 transitions. [2019-09-08 09:41:53,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:41:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 699359 states and 1091459 transitions. [2019-09-08 09:41:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:41:53,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:53,030 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:41:53,030 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:53,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:53,031 INFO L82 PathProgramCache]: Analyzing trace with hash 999057199, now seen corresponding path program 1 times [2019-09-08 09:41:53,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:53,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:53,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:41:53,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:53,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:53,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:53,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:53,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:53,102 INFO L87 Difference]: Start difference. First operand 699359 states and 1091459 transitions. Second operand 3 states. [2019-09-08 09:42:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:42,525 INFO L93 Difference]: Finished difference Result 1038546 states and 1616283 transitions. [2019-09-08 09:42:42,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:42:42,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 09:42:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:43,830 INFO L225 Difference]: With dead ends: 1038546 [2019-09-08 09:42:43,830 INFO L226 Difference]: Without dead ends: 699491 [2019-09-08 09:42:44,793 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 09:42:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699491 states. [2019-09-08 09:43:47,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699491 to 699489. [2019-09-08 09:43:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699489 states. [2019-09-08 09:43:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699489 states to 699489 states and 1083328 transitions. [2019-09-08 09:43:50,197 INFO L78 Accepts]: Start accepts. Automaton has 699489 states and 1083328 transitions. Word has length 102 [2019-09-08 09:43:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:50,198 INFO L475 AbstractCegarLoop]: Abstraction has 699489 states and 1083328 transitions. [2019-09-08 09:43:50,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 699489 states and 1083328 transitions. [2019-09-08 09:43:50,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:43:50,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:50,202 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:50,203 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:50,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1384335120, now seen corresponding path program 1 times [2019-09-08 09:43:50,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:50,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:50,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:50,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:50,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:43:50,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:50,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:50,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:50,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:50,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:50,399 INFO L87 Difference]: Start difference. First operand 699489 states and 1083328 transitions. Second operand 4 states. [2019-09-08 09:45:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:27,510 INFO L93 Difference]: Finished difference Result 1817228 states and 2815761 transitions. [2019-09-08 09:45:27,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:45:27,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-08 09:45:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:30,063 INFO L225 Difference]: With dead ends: 1817228 [2019-09-08 09:45:30,063 INFO L226 Difference]: Without dead ends: 1262519 [2019-09-08 09:45:30,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:45:31,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262519 states. [2019-09-08 09:47:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262519 to 1098279. [2019-09-08 09:47:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098279 states. [2019-09-08 09:47:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098279 states to 1098279 states and 1694865 transitions. [2019-09-08 09:47:33,266 INFO L78 Accepts]: Start accepts. Automaton has 1098279 states and 1694865 transitions. Word has length 102 [2019-09-08 09:47:33,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:33,266 INFO L475 AbstractCegarLoop]: Abstraction has 1098279 states and 1694865 transitions. [2019-09-08 09:47:33,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:47:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1098279 states and 1694865 transitions. [2019-09-08 09:47:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:47:33,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:33,269 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:47:33,269 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:33,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:33,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1738365354, now seen corresponding path program 1 times [2019-09-08 09:47:33,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:33,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:33,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:33,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:33,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:47:33,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:33,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:33,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:33,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:33,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:33,331 INFO L87 Difference]: Start difference. First operand 1098279 states and 1694865 transitions. Second operand 3 states.