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_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:08:51,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:08:51,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:08:51,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:08:51,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:08:51,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:08:51,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:08:51,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:08:51,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:08:51,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:08:51,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:08:51,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:08:51,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:08:51,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:08:51,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:08:51,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:08:51,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:08:51,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:08:51,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:08:51,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:08:51,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:08:51,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:08:51,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:08:51,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:08:51,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:08:51,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:08:51,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:08:51,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:08:51,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:08:51,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:08:51,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:08:51,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:08:51,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:08:51,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:08:51,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:08:51,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:08:51,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:08:51,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:08:51,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:08:51,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:08:51,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:08:51,185 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 13:08:51,199 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:08:51,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:08:51,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:08:51,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:08:51,201 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:08:51,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:08:51,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:08:51,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:08:51,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:08:51,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:08:51,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:08:51,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:08:51,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:08:51,203 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:08:51,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:08:51,203 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:08:51,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:08:51,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:08:51,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:08:51,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:08:51,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:08:51,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:08:51,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:08:51,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:08:51,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:08:51,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:08:51,205 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:08:51,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:08:51,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:08:51,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:08:51,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:08:51,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:08:51,248 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:08:51,248 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:08:51,249 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:08:51,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26eb1ab47/0c7dc4f3ae6749c285d6eeda986cab3e/FLAG7c472133a [2019-09-08 13:08:51,788 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:08:51,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:08:51,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26eb1ab47/0c7dc4f3ae6749c285d6eeda986cab3e/FLAG7c472133a [2019-09-08 13:08:52,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26eb1ab47/0c7dc4f3ae6749c285d6eeda986cab3e [2019-09-08 13:08:52,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:08:52,095 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:08:52,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:08:52,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:08:52,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:08:52,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:08:52" (1/1) ... [2019-09-08 13:08:52,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d4e3ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:52, skipping insertion in model container [2019-09-08 13:08:52,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:08:52" (1/1) ... [2019-09-08 13:08:52,110 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:08:52,170 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:08:52,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:08:52,713 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:08:53,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:08:53,095 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:08:53,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:53 WrapperNode [2019-09-08 13:08:53,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:08:53,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:08:53,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:08:53,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:08:53,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:53" (1/1) ... [2019-09-08 13:08:53,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:53" (1/1) ... [2019-09-08 13:08:53,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:53" (1/1) ... [2019-09-08 13:08:53,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:53" (1/1) ... [2019-09-08 13:08:53,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:53" (1/1) ... [2019-09-08 13:08:53,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:53" (1/1) ... [2019-09-08 13:08:53,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:53" (1/1) ... [2019-09-08 13:08:53,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:08:53,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:08:53,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:08:53,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:08:53,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:08:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:08:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:08:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:08:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:08:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:08:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:08:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:08:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:08:53,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:08:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:08:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:08:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:08:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:08:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:08:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:08:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:08:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:08:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:08:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:08:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:08:54,719 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:08:54,719 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:08:54,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:08:54 BoogieIcfgContainer [2019-09-08 13:08:54,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:08:54,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:08:54,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:08:54,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:08:54,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:08:52" (1/3) ... [2019-09-08 13:08:54,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4044d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:08:54, skipping insertion in model container [2019-09-08 13:08:54,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:53" (2/3) ... [2019-09-08 13:08:54,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4044d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:08:54, skipping insertion in model container [2019-09-08 13:08:54,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:08:54" (3/3) ... [2019-09-08 13:08:54,729 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:08:54,738 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:08:54,746 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:08:54,762 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:08:54,795 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:08:54,795 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:08:54,796 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:08:54,796 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:08:54,796 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:08:54,796 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:08:54,796 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:08:54,797 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:08:54,797 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:08:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states. [2019-09-08 13:08:54,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 13:08:54,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:54,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:54,841 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:54,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1480412157, now seen corresponding path program 1 times [2019-09-08 13:08:54,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:54,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:54,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:54,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:54,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:55,415 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 13:08:55,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:55,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:55,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:55,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:55,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:55,439 INFO L87 Difference]: Start difference. First operand 343 states. Second operand 3 states. [2019-09-08 13:08:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:55,590 INFO L93 Difference]: Finished difference Result 647 states and 1107 transitions. [2019-09-08 13:08:55,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:55,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-08 13:08:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:55,623 INFO L225 Difference]: With dead ends: 647 [2019-09-08 13:08:55,624 INFO L226 Difference]: Without dead ends: 481 [2019-09-08 13:08:55,631 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 13:08:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-09-08 13:08:55,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 478. [2019-09-08 13:08:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-09-08 13:08:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 793 transitions. [2019-09-08 13:08:55,740 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 793 transitions. Word has length 110 [2019-09-08 13:08:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:55,741 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 793 transitions. [2019-09-08 13:08:55,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 793 transitions. [2019-09-08 13:08:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 13:08:55,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:55,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:55,755 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:55,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1040646636, now seen corresponding path program 1 times [2019-09-08 13:08:55,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:55,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:55,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:55,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:55,958 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 13:08:55,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:55,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:55,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:55,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:55,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:55,962 INFO L87 Difference]: Start difference. First operand 478 states and 793 transitions. Second operand 3 states. [2019-09-08 13:08:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:56,026 INFO L93 Difference]: Finished difference Result 1044 states and 1733 transitions. [2019-09-08 13:08:56,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:56,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-08 13:08:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:56,032 INFO L225 Difference]: With dead ends: 1044 [2019-09-08 13:08:56,032 INFO L226 Difference]: Without dead ends: 751 [2019-09-08 13:08:56,035 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 13:08:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-09-08 13:08:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 747. [2019-09-08 13:08:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-09-08 13:08:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1238 transitions. [2019-09-08 13:08:56,087 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1238 transitions. Word has length 113 [2019-09-08 13:08:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:56,088 INFO L475 AbstractCegarLoop]: Abstraction has 747 states and 1238 transitions. [2019-09-08 13:08:56,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1238 transitions. [2019-09-08 13:08:56,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 13:08:56,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:56,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:56,092 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:56,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:56,092 INFO L82 PathProgramCache]: Analyzing trace with hash -915935034, now seen corresponding path program 1 times [2019-09-08 13:08:56,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:56,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:56,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:56,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:56,247 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 13:08:56,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:56,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:56,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:56,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:56,249 INFO L87 Difference]: Start difference. First operand 747 states and 1238 transitions. Second operand 3 states. [2019-09-08 13:08:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:56,315 INFO L93 Difference]: Finished difference Result 1831 states and 3032 transitions. [2019-09-08 13:08:56,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:56,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 13:08:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:56,323 INFO L225 Difference]: With dead ends: 1831 [2019-09-08 13:08:56,323 INFO L226 Difference]: Without dead ends: 1269 [2019-09-08 13:08:56,325 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 13:08:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-09-08 13:08:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1263. [2019-09-08 13:08:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-09-08 13:08:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 2086 transitions. [2019-09-08 13:08:56,379 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 2086 transitions. Word has length 116 [2019-09-08 13:08:56,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:56,379 INFO L475 AbstractCegarLoop]: Abstraction has 1263 states and 2086 transitions. [2019-09-08 13:08:56,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 2086 transitions. [2019-09-08 13:08:56,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 13:08:56,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:56,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:56,382 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:56,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:56,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2119644227, now seen corresponding path program 1 times [2019-09-08 13:08:56,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:56,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:56,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:56,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:56,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:56,531 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 13:08:56,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:56,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:56,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:56,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:56,533 INFO L87 Difference]: Start difference. First operand 1263 states and 2086 transitions. Second operand 3 states. [2019-09-08 13:08:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:56,645 INFO L93 Difference]: Finished difference Result 3339 states and 5504 transitions. [2019-09-08 13:08:56,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:56,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-08 13:08:56,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:56,659 INFO L225 Difference]: With dead ends: 3339 [2019-09-08 13:08:56,659 INFO L226 Difference]: Without dead ends: 2261 [2019-09-08 13:08:56,662 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 13:08:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-09-08 13:08:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2251. [2019-09-08 13:08:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2251 states. [2019-09-08 13:08:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 3698 transitions. [2019-09-08 13:08:56,770 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 3698 transitions. Word has length 119 [2019-09-08 13:08:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:56,771 INFO L475 AbstractCegarLoop]: Abstraction has 2251 states and 3698 transitions. [2019-09-08 13:08:56,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 3698 transitions. [2019-09-08 13:08:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 13:08:56,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:56,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:56,776 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:56,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1574727771, now seen corresponding path program 1 times [2019-09-08 13:08:56,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:56,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:56,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:57,030 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 13:08:57,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:57,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:08:57,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:08:57,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:08:57,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:08:57,032 INFO L87 Difference]: Start difference. First operand 2251 states and 3698 transitions. Second operand 6 states. [2019-09-08 13:08:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:57,631 INFO L93 Difference]: Finished difference Result 8621 states and 14227 transitions. [2019-09-08 13:08:57,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:08:57,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-09-08 13:08:57,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:57,666 INFO L225 Difference]: With dead ends: 8621 [2019-09-08 13:08:57,666 INFO L226 Difference]: Without dead ends: 6555 [2019-09-08 13:08:57,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:08:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6555 states. [2019-09-08 13:08:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6555 to 5152. [2019-09-08 13:08:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5152 states. [2019-09-08 13:08:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5152 states to 5152 states and 8473 transitions. [2019-09-08 13:08:57,969 INFO L78 Accepts]: Start accepts. Automaton has 5152 states and 8473 transitions. Word has length 122 [2019-09-08 13:08:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:57,969 INFO L475 AbstractCegarLoop]: Abstraction has 5152 states and 8473 transitions. [2019-09-08 13:08:57,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:08:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5152 states and 8473 transitions. [2019-09-08 13:08:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 13:08:57,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:57,974 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:57,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:57,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1505752343, now seen corresponding path program 1 times [2019-09-08 13:08:57,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:57,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:57,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:57,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:57,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:58,228 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 13:08:58,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:58,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:58,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:58,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:58,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:58,230 INFO L87 Difference]: Start difference. First operand 5152 states and 8473 transitions. Second operand 4 states. [2019-09-08 13:08:58,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:58,663 INFO L93 Difference]: Finished difference Result 13690 states and 22600 transitions. [2019-09-08 13:08:58,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:08:58,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-08 13:08:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:58,706 INFO L225 Difference]: With dead ends: 13690 [2019-09-08 13:08:58,706 INFO L226 Difference]: Without dead ends: 8723 [2019-09-08 13:08:58,721 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 13:08:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8723 states. [2019-09-08 13:08:59,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8723 to 7617. [2019-09-08 13:08:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7617 states. [2019-09-08 13:08:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7617 states to 7617 states and 12546 transitions. [2019-09-08 13:08:59,126 INFO L78 Accepts]: Start accepts. Automaton has 7617 states and 12546 transitions. Word has length 123 [2019-09-08 13:08:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:59,126 INFO L475 AbstractCegarLoop]: Abstraction has 7617 states and 12546 transitions. [2019-09-08 13:08:59,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:08:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 7617 states and 12546 transitions. [2019-09-08 13:08:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 13:08:59,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:59,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:59,132 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:59,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:59,133 INFO L82 PathProgramCache]: Analyzing trace with hash -627927902, now seen corresponding path program 1 times [2019-09-08 13:08:59,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:59,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:59,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:59,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:59,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:59,288 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 13:08:59,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:59,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:59,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:59,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:59,290 INFO L87 Difference]: Start difference. First operand 7617 states and 12546 transitions. Second operand 4 states. [2019-09-08 13:08:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:59,872 INFO L93 Difference]: Finished difference Result 20290 states and 33474 transitions. [2019-09-08 13:08:59,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:08:59,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-08 13:08:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:59,919 INFO L225 Difference]: With dead ends: 20290 [2019-09-08 13:08:59,920 INFO L226 Difference]: Without dead ends: 12858 [2019-09-08 13:08:59,935 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 13:08:59,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12858 states. [2019-09-08 13:09:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12858 to 11192. [2019-09-08 13:09:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11192 states. [2019-09-08 13:09:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11192 states to 11192 states and 18415 transitions. [2019-09-08 13:09:00,535 INFO L78 Accepts]: Start accepts. Automaton has 11192 states and 18415 transitions. Word has length 124 [2019-09-08 13:09:00,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:00,536 INFO L475 AbstractCegarLoop]: Abstraction has 11192 states and 18415 transitions. [2019-09-08 13:09:00,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 11192 states and 18415 transitions. [2019-09-08 13:09:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 13:09:00,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:00,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:00,542 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:00,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1952019262, now seen corresponding path program 1 times [2019-09-08 13:09:00,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:00,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:00,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:00,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:00,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:00,676 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 13:09:00,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:00,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:09:00,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:09:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:09:00,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:09:00,678 INFO L87 Difference]: Start difference. First operand 11192 states and 18415 transitions. Second operand 7 states. [2019-09-08 13:09:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:03,128 INFO L93 Difference]: Finished difference Result 52328 states and 86141 transitions. [2019-09-08 13:09:03,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 13:09:03,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2019-09-08 13:09:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:03,237 INFO L225 Difference]: With dead ends: 52328 [2019-09-08 13:09:03,237 INFO L226 Difference]: Without dead ends: 41321 [2019-09-08 13:09:03,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:09:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41321 states. [2019-09-08 13:09:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41321 to 32200. [2019-09-08 13:09:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32200 states. [2019-09-08 13:09:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32200 states to 32200 states and 52792 transitions. [2019-09-08 13:09:05,109 INFO L78 Accepts]: Start accepts. Automaton has 32200 states and 52792 transitions. Word has length 125 [2019-09-08 13:09:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:05,110 INFO L475 AbstractCegarLoop]: Abstraction has 32200 states and 52792 transitions. [2019-09-08 13:09:05,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:09:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 32200 states and 52792 transitions. [2019-09-08 13:09:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 13:09:05,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:05,117 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:05,117 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:05,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:05,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1179888794, now seen corresponding path program 1 times [2019-09-08 13:09:05,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:05,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:05,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:05,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:05,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:05,236 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 13:09:05,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:05,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:05,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:05,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:05,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:05,238 INFO L87 Difference]: Start difference. First operand 32200 states and 52792 transitions. Second operand 3 states. [2019-09-08 13:09:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:07,292 INFO L93 Difference]: Finished difference Result 68566 states and 112375 transitions. [2019-09-08 13:09:07,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:07,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 13:09:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:07,383 INFO L225 Difference]: With dead ends: 68566 [2019-09-08 13:09:07,383 INFO L226 Difference]: Without dead ends: 47772 [2019-09-08 13:09:07,425 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 13:09:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47772 states. [2019-09-08 13:09:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47772 to 47770. [2019-09-08 13:09:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47770 states. [2019-09-08 13:09:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47770 states to 47770 states and 78022 transitions. [2019-09-08 13:09:09,065 INFO L78 Accepts]: Start accepts. Automaton has 47770 states and 78022 transitions. Word has length 126 [2019-09-08 13:09:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:09,065 INFO L475 AbstractCegarLoop]: Abstraction has 47770 states and 78022 transitions. [2019-09-08 13:09:09,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 47770 states and 78022 transitions. [2019-09-08 13:09:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 13:09:09,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:09,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:09,070 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:09,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash 330560745, now seen corresponding path program 1 times [2019-09-08 13:09:09,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:09,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:09,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:09,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:09,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:09,161 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 13:09:09,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:09,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:09,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:09,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:09,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:09,162 INFO L87 Difference]: Start difference. First operand 47770 states and 78022 transitions. Second operand 4 states. [2019-09-08 13:09:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:12,988 INFO L93 Difference]: Finished difference Result 129919 states and 212568 transitions. [2019-09-08 13:09:12,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:09:12,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-08 13:09:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:13,154 INFO L225 Difference]: With dead ends: 129919 [2019-09-08 13:09:13,158 INFO L226 Difference]: Without dead ends: 85170 [2019-09-08 13:09:13,240 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 13:09:13,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85170 states. [2019-09-08 13:09:15,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85170 to 66318. [2019-09-08 13:09:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66318 states. [2019-09-08 13:09:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66318 states to 66318 states and 108255 transitions. [2019-09-08 13:09:15,894 INFO L78 Accepts]: Start accepts. Automaton has 66318 states and 108255 transitions. Word has length 126 [2019-09-08 13:09:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:15,895 INFO L475 AbstractCegarLoop]: Abstraction has 66318 states and 108255 transitions. [2019-09-08 13:09:15,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 66318 states and 108255 transitions. [2019-09-08 13:09:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 13:09:15,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:15,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:15,898 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:15,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1031111542, now seen corresponding path program 1 times [2019-09-08 13:09:15,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:15,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:15,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:15,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:15,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:15,988 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 13:09:15,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:15,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:15,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:15,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:15,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:15,990 INFO L87 Difference]: Start difference. First operand 66318 states and 108255 transitions. Second operand 3 states. [2019-09-08 13:09:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:20,305 INFO L93 Difference]: Finished difference Result 149323 states and 243877 transitions. [2019-09-08 13:09:20,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:20,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 13:09:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:20,495 INFO L225 Difference]: With dead ends: 149323 [2019-09-08 13:09:20,495 INFO L226 Difference]: Without dead ends: 100637 [2019-09-08 13:09:20,565 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 13:09:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100637 states. [2019-09-08 13:09:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100637 to 100635. [2019-09-08 13:09:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100635 states. [2019-09-08 13:09:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100635 states to 100635 states and 163626 transitions. [2019-09-08 13:09:26,231 INFO L78 Accepts]: Start accepts. Automaton has 100635 states and 163626 transitions. Word has length 126 [2019-09-08 13:09:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:26,231 INFO L475 AbstractCegarLoop]: Abstraction has 100635 states and 163626 transitions. [2019-09-08 13:09:26,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 100635 states and 163626 transitions. [2019-09-08 13:09:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 13:09:26,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:26,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:26,234 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash 590709654, now seen corresponding path program 1 times [2019-09-08 13:09:26,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:26,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:26,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:26,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:26,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:26,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 13:09:26,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:26,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:26,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:26,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:26,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:26,313 INFO L87 Difference]: Start difference. First operand 100635 states and 163626 transitions. Second operand 3 states. [2019-09-08 13:09:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:32,040 INFO L93 Difference]: Finished difference Result 218945 states and 356276 transitions. [2019-09-08 13:09:32,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:32,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 13:09:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:32,241 INFO L225 Difference]: With dead ends: 218945 [2019-09-08 13:09:32,241 INFO L226 Difference]: Without dead ends: 148807 [2019-09-08 13:09:32,320 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 13:09:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148807 states. [2019-09-08 13:09:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148807 to 148805. [2019-09-08 13:09:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148805 states. [2019-09-08 13:09:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148805 states to 148805 states and 240971 transitions. [2019-09-08 13:09:40,124 INFO L78 Accepts]: Start accepts. Automaton has 148805 states and 240971 transitions. Word has length 126 [2019-09-08 13:09:40,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:40,124 INFO L475 AbstractCegarLoop]: Abstraction has 148805 states and 240971 transitions. [2019-09-08 13:09:40,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 148805 states and 240971 transitions. [2019-09-08 13:09:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 13:09:40,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:40,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:40,126 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:40,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:40,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1885688154, now seen corresponding path program 1 times [2019-09-08 13:09:40,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:40,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:40,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:40,201 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 13:09:40,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:40,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:40,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:40,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:40,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:40,203 INFO L87 Difference]: Start difference. First operand 148805 states and 240971 transitions. Second operand 3 states. [2019-09-08 13:09:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:49,931 INFO L93 Difference]: Finished difference Result 321944 states and 523313 transitions. [2019-09-08 13:09:49,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:49,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 13:09:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:50,262 INFO L225 Difference]: With dead ends: 321944 [2019-09-08 13:09:50,262 INFO L226 Difference]: Without dead ends: 216925 [2019-09-08 13:09:50,363 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 13:09:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216925 states. [2019-09-08 13:10:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216925 to 216923. [2019-09-08 13:10:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216923 states. [2019-09-08 13:10:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216923 states to 216923 states and 350263 transitions. [2019-09-08 13:10:02,248 INFO L78 Accepts]: Start accepts. Automaton has 216923 states and 350263 transitions. Word has length 126 [2019-09-08 13:10:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:02,248 INFO L475 AbstractCegarLoop]: Abstraction has 216923 states and 350263 transitions. [2019-09-08 13:10:02,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 216923 states and 350263 transitions. [2019-09-08 13:10:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 13:10:02,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:02,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:02,250 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:02,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1648333671, now seen corresponding path program 1 times [2019-09-08 13:10:02,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:02,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:02,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:02,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:02,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:02,562 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 13:10:02,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:02,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:10:02,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:10:02,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:10:02,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:10:02,565 INFO L87 Difference]: Start difference. First operand 216923 states and 350263 transitions. Second operand 6 states. [2019-09-08 13:10:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:20,561 INFO L93 Difference]: Finished difference Result 529855 states and 856366 transitions. [2019-09-08 13:10:20,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:10:20,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-08 13:10:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:21,011 INFO L225 Difference]: With dead ends: 529855 [2019-09-08 13:10:21,011 INFO L226 Difference]: Without dead ends: 313185 [2019-09-08 13:10:21,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:10:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313185 states. [2019-09-08 13:10:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313185 to 247483. [2019-09-08 13:10:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247483 states. [2019-09-08 13:10:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247483 states to 247483 states and 398873 transitions. [2019-09-08 13:10:35,109 INFO L78 Accepts]: Start accepts. Automaton has 247483 states and 398873 transitions. Word has length 128 [2019-09-08 13:10:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:35,110 INFO L475 AbstractCegarLoop]: Abstraction has 247483 states and 398873 transitions. [2019-09-08 13:10:35,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:10:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 247483 states and 398873 transitions. [2019-09-08 13:10:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 13:10:35,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:35,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:35,111 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1098345903, now seen corresponding path program 1 times [2019-09-08 13:10:35,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:35,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:35,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:35,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:35,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:35,342 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 13:10:35,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:35,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:10:35,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:10:35,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:10:35,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:10:35,344 INFO L87 Difference]: Start difference. First operand 247483 states and 398873 transitions. Second operand 6 states. [2019-09-08 13:11:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:02,278 INFO L93 Difference]: Finished difference Result 727999 states and 1176036 transitions. [2019-09-08 13:11:02,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:11:02,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-09-08 13:11:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:03,042 INFO L225 Difference]: With dead ends: 727999 [2019-09-08 13:11:03,042 INFO L226 Difference]: Without dead ends: 480769 [2019-09-08 13:11:03,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:11:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480769 states. [2019-09-08 13:11:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480769 to 440411. [2019-09-08 13:11:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440411 states. [2019-09-08 13:11:39,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440411 states to 440411 states and 709530 transitions. [2019-09-08 13:11:39,254 INFO L78 Accepts]: Start accepts. Automaton has 440411 states and 709530 transitions. Word has length 131 [2019-09-08 13:11:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:39,254 INFO L475 AbstractCegarLoop]: Abstraction has 440411 states and 709530 transitions. [2019-09-08 13:11:39,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:11:39,254 INFO L276 IsEmpty]: Start isEmpty. Operand 440411 states and 709530 transitions. [2019-09-08 13:11:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 13:11:39,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:39,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:39,255 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:39,255 INFO L82 PathProgramCache]: Analyzing trace with hash -312924490, now seen corresponding path program 1 times [2019-09-08 13:11:39,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:39,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:39,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:39,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:39,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:39,384 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 13:11:39,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:39,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:11:39,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:11:39,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:11:39,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:11:39,386 INFO L87 Difference]: Start difference. First operand 440411 states and 709530 transitions. Second operand 5 states. [2019-09-08 13:12:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:25,115 INFO L93 Difference]: Finished difference Result 737101 states and 1183387 transitions. [2019-09-08 13:12:25,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:12:25,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-08 13:12:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:26,327 INFO L225 Difference]: With dead ends: 737101 [2019-09-08 13:12:26,327 INFO L226 Difference]: Without dead ends: 737099 [2019-09-08 13:12:26,460 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 13:12:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737099 states. [2019-09-08 13:13:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737099 to 446323. [2019-09-08 13:13:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446323 states. [2019-09-08 13:13:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446323 states to 446323 states and 715397 transitions. [2019-09-08 13:13:10,108 INFO L78 Accepts]: Start accepts. Automaton has 446323 states and 715397 transitions. Word has length 132 [2019-09-08 13:13:10,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:13:10,108 INFO L475 AbstractCegarLoop]: Abstraction has 446323 states and 715397 transitions. [2019-09-08 13:13:10,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:13:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 446323 states and 715397 transitions. [2019-09-08 13:13:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:13:10,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:13:10,113 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:13:10,114 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:13:10,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:13:10,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1657589921, now seen corresponding path program 1 times [2019-09-08 13:13:10,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:13:10,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:13:10,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:10,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:13:10,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:13:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 13:13:10,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:13:10,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:13:10,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:13:10,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:13:10,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:13:10,292 INFO L87 Difference]: Start difference. First operand 446323 states and 715397 transitions. Second operand 6 states. [2019-09-08 13:13:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:13:49,993 INFO L93 Difference]: Finished difference Result 766014 states and 1232004 transitions. [2019-09-08 13:13:49,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:13:49,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-09-08 13:13:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:13:50,826 INFO L225 Difference]: With dead ends: 766014 [2019-09-08 13:13:50,827 INFO L226 Difference]: Without dead ends: 540400 [2019-09-08 13:13:51,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:13:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540400 states. [2019-09-08 13:14:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540400 to 498590. [2019-09-08 13:14:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498590 states. [2019-09-08 13:14:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498590 states to 498590 states and 799189 transitions. [2019-09-08 13:14:32,665 INFO L78 Accepts]: Start accepts. Automaton has 498590 states and 799189 transitions. Word has length 168 [2019-09-08 13:14:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:32,666 INFO L475 AbstractCegarLoop]: Abstraction has 498590 states and 799189 transitions. [2019-09-08 13:14:32,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:14:32,666 INFO L276 IsEmpty]: Start isEmpty. Operand 498590 states and 799189 transitions. [2019-09-08 13:14:32,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:14:32,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:32,670 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:32,670 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:32,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:32,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1508812669, now seen corresponding path program 1 times [2019-09-08 13:14:32,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:32,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:32,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:32,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:32,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:32,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:32,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:32,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:32,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:32,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:32,793 INFO L87 Difference]: Start difference. First operand 498590 states and 799189 transitions. Second operand 3 states. [2019-09-08 13:15:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:04,596 INFO L93 Difference]: Finished difference Result 900615 states and 1447199 transitions. [2019-09-08 13:15:04,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:04,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 13:15:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:05,274 INFO L225 Difference]: With dead ends: 900615 [2019-09-08 13:15:05,274 INFO L226 Difference]: Without dead ends: 402278 [2019-09-08 13:15:05,619 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 13:15:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402278 states. [2019-09-08 13:15:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402278 to 402276. [2019-09-08 13:15:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402276 states. [2019-09-08 13:15:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402276 states to 402276 states and 646133 transitions. [2019-09-08 13:15:40,554 INFO L78 Accepts]: Start accepts. Automaton has 402276 states and 646133 transitions. Word has length 168 [2019-09-08 13:15:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:40,555 INFO L475 AbstractCegarLoop]: Abstraction has 402276 states and 646133 transitions. [2019-09-08 13:15:40,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 402276 states and 646133 transitions. [2019-09-08 13:15:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:15:40,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:40,559 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:15:40,560 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:40,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:40,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1407987027, now seen corresponding path program 1 times [2019-09-08 13:15:40,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:40,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:40,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:40,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:40,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:15:41,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:41,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:41,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:41,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:41,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:41,695 INFO L87 Difference]: Start difference. First operand 402276 states and 646133 transitions. Second operand 3 states. [2019-09-08 13:15:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:59,664 INFO L93 Difference]: Finished difference Result 571817 states and 918937 transitions. [2019-09-08 13:15:59,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:59,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 13:15:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:59,910 INFO L225 Difference]: With dead ends: 571817 [2019-09-08 13:15:59,910 INFO L226 Difference]: Without dead ends: 169831 [2019-09-08 13:16:00,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:16:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169831 states. [2019-09-08 13:16:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169831 to 169829. [2019-09-08 13:16:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169829 states. [2019-09-08 13:16:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169829 states to 169829 states and 272225 transitions. [2019-09-08 13:16:10,327 INFO L78 Accepts]: Start accepts. Automaton has 169829 states and 272225 transitions. Word has length 168 [2019-09-08 13:16:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:10,327 INFO L475 AbstractCegarLoop]: Abstraction has 169829 states and 272225 transitions. [2019-09-08 13:16:10,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:16:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 169829 states and 272225 transitions. [2019-09-08 13:16:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 13:16:10,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:10,330 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:16:10,330 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:10,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1987987435, now seen corresponding path program 1 times [2019-09-08 13:16:10,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:10,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:10,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:10,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:16:10,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:16:10,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:16:10,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:10,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 13:16:10,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:16:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 13:16:10,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:16:10,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 13:16:10,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:16:10,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:16:10,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:16:10,896 INFO L87 Difference]: Start difference. First operand 169829 states and 272225 transitions. Second operand 9 states. [2019-09-08 13:16:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:36,256 INFO L93 Difference]: Finished difference Result 404956 states and 651718 transitions. [2019-09-08 13:16:36,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 13:16:36,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 171 [2019-09-08 13:16:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:36,972 INFO L225 Difference]: With dead ends: 404956 [2019-09-08 13:16:36,972 INFO L226 Difference]: Without dead ends: 325386 [2019-09-08 13:16:37,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:16:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325386 states. [2019-09-08 13:16:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325386 to 285725. [2019-09-08 13:16:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285725 states. [2019-09-08 13:16:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285725 states to 285725 states and 458393 transitions. [2019-09-08 13:16:58,450 INFO L78 Accepts]: Start accepts. Automaton has 285725 states and 458393 transitions. Word has length 171 [2019-09-08 13:16:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:58,451 INFO L475 AbstractCegarLoop]: Abstraction has 285725 states and 458393 transitions. [2019-09-08 13:16:58,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:16:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 285725 states and 458393 transitions. [2019-09-08 13:16:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 13:16:58,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:58,457 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:16:58,458 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:58,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:58,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1074362494, now seen corresponding path program 1 times [2019-09-08 13:16:58,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:58,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:58,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:58,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:58,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:16:58,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:16:58,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 13:16:58,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:16:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:58,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 13:16:58,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:16:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:16:58,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:16:58,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 13:16:58,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:16:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:16:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:16:58,984 INFO L87 Difference]: Start difference. First operand 285725 states and 458393 transitions. Second operand 9 states. [2019-09-08 13:17:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:37,694 INFO L93 Difference]: Finished difference Result 647960 states and 1043760 transitions. [2019-09-08 13:17:37,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 13:17:37,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 171 [2019-09-08 13:17:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:38,455 INFO L225 Difference]: With dead ends: 647960 [2019-09-08 13:17:38,455 INFO L226 Difference]: Without dead ends: 540622 [2019-09-08 13:17:38,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-09-08 13:17:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540622 states. [2019-09-08 13:18:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540622 to 369526. [2019-09-08 13:18:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369526 states. [2019-09-08 13:18:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369526 states to 369526 states and 592785 transitions. [2019-09-08 13:18:14,339 INFO L78 Accepts]: Start accepts. Automaton has 369526 states and 592785 transitions. Word has length 171 [2019-09-08 13:18:14,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:14,340 INFO L475 AbstractCegarLoop]: Abstraction has 369526 states and 592785 transitions. [2019-09-08 13:18:14,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:18:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 369526 states and 592785 transitions. [2019-09-08 13:18:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 13:18:14,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:14,343 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:14,343 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:14,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:14,344 INFO L82 PathProgramCache]: Analyzing trace with hash -501825097, now seen corresponding path program 1 times [2019-09-08 13:18:14,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:14,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:14,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:18:14,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:14,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:14,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:14,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:14,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:14,448 INFO L87 Difference]: Start difference. First operand 369526 states and 592785 transitions. Second operand 3 states. [2019-09-08 13:19:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:07,762 INFO L93 Difference]: Finished difference Result 803436 states and 1289608 transitions. [2019-09-08 13:19:07,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:07,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 13:19:07,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:08,950 INFO L225 Difference]: With dead ends: 803436 [2019-09-08 13:19:08,950 INFO L226 Difference]: Without dead ends: 690889 [2019-09-08 13:19:09,136 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 13:19:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690889 states.