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.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:08:40,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:08:40,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:08:40,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:08:40,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:08:40,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:08:40,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:08:40,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:08:40,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:08:40,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:08:40,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:08:40,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:08:40,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:08:40,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:08:40,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:08:40,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:08:40,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:08:40,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:08:40,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:08:40,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:08:40,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:08:40,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:08:40,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:08:40,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:08:40,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:08:40,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:08:40,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:08:40,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:08:40,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:08:40,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:08:40,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:08:40,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:08:40,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:08:40,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:08:40,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:08:40,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:08:40,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:08:40,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:08:40,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:08:40,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:08:40,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:08:40,163 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:40,178 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:08:40,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:08:40,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:08:40,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:08:40,180 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:08:40,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:08:40,181 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:08:40,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:08:40,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:08:40,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:08:40,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:08:40,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:08:40,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:08:40,182 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:08:40,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:08:40,183 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:08:40,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:08:40,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:08:40,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:08:40,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:08:40,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:08:40,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:08:40,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:08:40,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:08:40,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:08:40,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:08:40,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:08:40,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:08:40,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:08:40,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:08:40,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:08:40,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:08:40,236 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:08:40,236 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:08:40,237 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.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:08:40,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc5b324b/eec2a78c96c14f6596be94b73b700f90/FLAGb2f77f6cb [2019-09-08 13:08:40,956 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:08:40,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:08:40,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc5b324b/eec2a78c96c14f6596be94b73b700f90/FLAGb2f77f6cb [2019-09-08 13:08:41,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc5b324b/eec2a78c96c14f6596be94b73b700f90 [2019-09-08 13:08:41,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:08:41,142 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:08:41,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:08:41,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:08:41,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:08:41,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:08:41" (1/1) ... [2019-09-08 13:08:41,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7594377c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:41, skipping insertion in model container [2019-09-08 13:08:41,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:08:41" (1/1) ... [2019-09-08 13:08:41,164 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:08:41,296 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:08:42,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:08:42,339 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:08:42,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:08:42,821 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:08:42,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:42 WrapperNode [2019-09-08 13:08:42,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:08:42,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:08:42,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:08:42,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:08:42,843 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:42" (1/1) ... [2019-09-08 13:08:42,843 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:42" (1/1) ... [2019-09-08 13:08:42,885 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:42" (1/1) ... [2019-09-08 13:08:42,886 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:42" (1/1) ... [2019-09-08 13:08:42,951 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:42" (1/1) ... [2019-09-08 13:08:42,977 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:42" (1/1) ... [2019-09-08 13:08:42,991 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:42" (1/1) ... [2019-09-08 13:08:43,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:08:43,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:08:43,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:08:43,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:08:43,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:42" (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:43,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:08:43,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:08:43,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:08:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:08:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:08:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:08:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:08:43,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:08:43,088 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:08:43,088 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:08:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:08:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:08:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:08:43,090 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:08:43,091 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:08:43,091 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:08:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:08:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:08:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:08:45,712 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:08:45,713 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:08:45,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:08:45 BoogieIcfgContainer [2019-09-08 13:08:45,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:08:45,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:08:45,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:08:45,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:08:45,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:08:41" (1/3) ... [2019-09-08 13:08:45,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568e50e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:08:45, skipping insertion in model container [2019-09-08 13:08:45,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:42" (2/3) ... [2019-09-08 13:08:45,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568e50e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:08:45, skipping insertion in model container [2019-09-08 13:08:45,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:08:45" (3/3) ... [2019-09-08 13:08:45,724 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:08:45,736 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:08:45,758 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:08:45,781 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:08:45,832 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:08:45,833 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:08:45,833 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:08:45,833 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:08:45,834 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:08:45,834 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:08:45,834 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:08:45,834 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:08:45,834 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:08:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states. [2019-09-08 13:08:45,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 13:08:45,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:45,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,919 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:45,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1585949308, now seen corresponding path program 1 times [2019-09-08 13:08:45,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:45,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:45,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:45,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:45,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:46,945 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:46,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:46,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:46,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:46,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:46,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:46,967 INFO L87 Difference]: Start difference. First operand 783 states. Second operand 3 states. [2019-09-08 13:08:47,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:47,396 INFO L93 Difference]: Finished difference Result 1478 states and 2597 transitions. [2019-09-08 13:08:47,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:47,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-08 13:08:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:47,446 INFO L225 Difference]: With dead ends: 1478 [2019-09-08 13:08:47,446 INFO L226 Difference]: Without dead ends: 1272 [2019-09-08 13:08:47,457 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:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-09-08 13:08:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1270. [2019-09-08 13:08:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-09-08 13:08:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1993 transitions. [2019-09-08 13:08:47,645 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1993 transitions. Word has length 312 [2019-09-08 13:08:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:47,647 INFO L475 AbstractCegarLoop]: Abstraction has 1270 states and 1993 transitions. [2019-09-08 13:08:47,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1993 transitions. [2019-09-08 13:08:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 13:08:47,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:47,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,657 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:47,658 INFO L82 PathProgramCache]: Analyzing trace with hash 711078858, now seen corresponding path program 1 times [2019-09-08 13:08:47,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:47,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:47,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:47,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:47,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:48,086 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:48,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:48,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:48,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:48,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:48,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:48,090 INFO L87 Difference]: Start difference. First operand 1270 states and 1993 transitions. Second operand 3 states. [2019-09-08 13:08:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:48,304 INFO L93 Difference]: Finished difference Result 2600 states and 4106 transitions. [2019-09-08 13:08:48,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:48,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-08 13:08:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:48,322 INFO L225 Difference]: With dead ends: 2600 [2019-09-08 13:08:48,322 INFO L226 Difference]: Without dead ends: 2236 [2019-09-08 13:08:48,330 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:48,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2019-09-08 13:08:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2234. [2019-09-08 13:08:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-09-08 13:08:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3495 transitions. [2019-09-08 13:08:48,430 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3495 transitions. Word has length 312 [2019-09-08 13:08:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:48,432 INFO L475 AbstractCegarLoop]: Abstraction has 2234 states and 3495 transitions. [2019-09-08 13:08:48,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3495 transitions. [2019-09-08 13:08:48,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 13:08:48,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:48,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,442 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:48,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:48,443 INFO L82 PathProgramCache]: Analyzing trace with hash -103281279, now seen corresponding path program 1 times [2019-09-08 13:08:48,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:48,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:48,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:48,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:48,905 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:48,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:48,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:48,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:48,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:48,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:48,909 INFO L87 Difference]: Start difference. First operand 2234 states and 3495 transitions. Second operand 3 states. [2019-09-08 13:08:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:49,206 INFO L93 Difference]: Finished difference Result 4810 states and 7581 transitions. [2019-09-08 13:08:49,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:49,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-08 13:08:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:49,237 INFO L225 Difference]: With dead ends: 4810 [2019-09-08 13:08:49,237 INFO L226 Difference]: Without dead ends: 4128 [2019-09-08 13:08:49,241 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:49,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4128 states. [2019-09-08 13:08:49,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4128 to 4126. [2019-09-08 13:08:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4126 states. [2019-09-08 13:08:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 6435 transitions. [2019-09-08 13:08:49,448 INFO L78 Accepts]: Start accepts. Automaton has 4126 states and 6435 transitions. Word has length 312 [2019-09-08 13:08:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:49,449 INFO L475 AbstractCegarLoop]: Abstraction has 4126 states and 6435 transitions. [2019-09-08 13:08:49,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4126 states and 6435 transitions. [2019-09-08 13:08:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 13:08:49,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:49,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,462 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1910629545, now seen corresponding path program 1 times [2019-09-08 13:08:49,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:49,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:49,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:49,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:49,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:49,892 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:49,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:49,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:49,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:49,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:49,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:49,894 INFO L87 Difference]: Start difference. First operand 4126 states and 6435 transitions. Second operand 3 states. [2019-09-08 13:08:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:50,284 INFO L93 Difference]: Finished difference Result 9114 states and 14329 transitions. [2019-09-08 13:08:50,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:50,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-08 13:08:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:50,339 INFO L225 Difference]: With dead ends: 9114 [2019-09-08 13:08:50,339 INFO L226 Difference]: Without dead ends: 7840 [2019-09-08 13:08:50,347 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:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7840 states. [2019-09-08 13:08:50,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7840 to 7838. [2019-09-08 13:08:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7838 states. [2019-09-08 13:08:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7838 states to 7838 states and 12187 transitions. [2019-09-08 13:08:50,771 INFO L78 Accepts]: Start accepts. Automaton has 7838 states and 12187 transitions. Word has length 312 [2019-09-08 13:08:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:50,772 INFO L475 AbstractCegarLoop]: Abstraction has 7838 states and 12187 transitions. [2019-09-08 13:08:50,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 7838 states and 12187 transitions. [2019-09-08 13:08:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 13:08:50,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:50,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,793 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:50,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash 591051586, now seen corresponding path program 1 times [2019-09-08 13:08:50,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:50,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:50,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:50,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:50,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:51,787 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:51,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:51,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:51,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:51,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:51,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:51,789 INFO L87 Difference]: Start difference. First operand 7838 states and 12187 transitions. Second operand 4 states. [2019-09-08 13:08:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:52,620 INFO L93 Difference]: Finished difference Result 23187 states and 36018 transitions. [2019-09-08 13:08:52,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:08:52,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-08 13:08:52,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:52,700 INFO L225 Difference]: With dead ends: 23187 [2019-09-08 13:08:52,701 INFO L226 Difference]: Without dead ends: 15364 [2019-09-08 13:08:52,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:08:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15364 states. [2019-09-08 13:08:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15364 to 15362. [2019-09-08 13:08:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15362 states. [2019-09-08 13:08:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15362 states to 15362 states and 23748 transitions. [2019-09-08 13:08:53,503 INFO L78 Accepts]: Start accepts. Automaton has 15362 states and 23748 transitions. Word has length 312 [2019-09-08 13:08:53,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:53,504 INFO L475 AbstractCegarLoop]: Abstraction has 15362 states and 23748 transitions. [2019-09-08 13:08:53,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:08:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 15362 states and 23748 transitions. [2019-09-08 13:08:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 13:08:53,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:53,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,553 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:53,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:53,554 INFO L82 PathProgramCache]: Analyzing trace with hash -341742011, now seen corresponding path program 1 times [2019-09-08 13:08:53,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:53,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:53,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:53,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:53,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:53,865 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:53,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:53,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:53,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:53,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:53,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:53,868 INFO L87 Difference]: Start difference. First operand 15362 states and 23748 transitions. Second operand 3 states. [2019-09-08 13:08:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:54,730 INFO L93 Difference]: Finished difference Result 45347 states and 70000 transitions. [2019-09-08 13:08:54,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:54,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 13:08:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:54,811 INFO L225 Difference]: With dead ends: 45347 [2019-09-08 13:08:54,812 INFO L226 Difference]: Without dead ends: 30114 [2019-09-08 13:08:54,861 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:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30114 states. [2019-09-08 13:08:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30114 to 30112. [2019-09-08 13:08:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30112 states. [2019-09-08 13:08:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30112 states to 30112 states and 46273 transitions. [2019-09-08 13:08:56,934 INFO L78 Accepts]: Start accepts. Automaton has 30112 states and 46273 transitions. Word has length 314 [2019-09-08 13:08:56,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:56,934 INFO L475 AbstractCegarLoop]: Abstraction has 30112 states and 46273 transitions. [2019-09-08 13:08:56,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 30112 states and 46273 transitions. [2019-09-08 13:08:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 13:08:56,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:56,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,998 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:56,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1364269386, now seen corresponding path program 1 times [2019-09-08 13:08:57,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:57,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:57,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:57,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:57,139 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,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:57,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:57,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:57,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:57,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:57,142 INFO L87 Difference]: Start difference. First operand 30112 states and 46273 transitions. Second operand 3 states. [2019-09-08 13:08:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:58,740 INFO L93 Difference]: Finished difference Result 90261 states and 138695 transitions. [2019-09-08 13:08:58,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:58,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 13:08:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:58,908 INFO L225 Difference]: With dead ends: 90261 [2019-09-08 13:08:58,908 INFO L226 Difference]: Without dead ends: 60191 [2019-09-08 13:08:59,005 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:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60191 states. [2019-09-08 13:09:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60191 to 30131. [2019-09-08 13:09:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30131 states. [2019-09-08 13:09:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30131 states to 30131 states and 46301 transitions. [2019-09-08 13:09:01,641 INFO L78 Accepts]: Start accepts. Automaton has 30131 states and 46301 transitions. Word has length 314 [2019-09-08 13:09:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:01,641 INFO L475 AbstractCegarLoop]: Abstraction has 30131 states and 46301 transitions. [2019-09-08 13:09:01,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 30131 states and 46301 transitions. [2019-09-08 13:09:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-08 13:09:01,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:01,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,708 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:01,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:01,708 INFO L82 PathProgramCache]: Analyzing trace with hash 297913838, now seen corresponding path program 1 times [2019-09-08 13:09:01,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:01,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:01,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:01,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:01,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:01,990 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:01,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:01,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:01,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:01,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:01,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:01,993 INFO L87 Difference]: Start difference. First operand 30131 states and 46301 transitions. Second operand 3 states. [2019-09-08 13:09:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:03,224 INFO L93 Difference]: Finished difference Result 90280 states and 138716 transitions. [2019-09-08 13:09:03,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:03,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-08 13:09:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:03,340 INFO L225 Difference]: With dead ends: 90280 [2019-09-08 13:09:03,340 INFO L226 Difference]: Without dead ends: 60209 [2019-09-08 13:09:03,653 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:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60209 states. [2019-09-08 13:09:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60209 to 30149. [2019-09-08 13:09:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30149 states. [2019-09-08 13:09:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30149 states to 30149 states and 46322 transitions. [2019-09-08 13:09:04,961 INFO L78 Accepts]: Start accepts. Automaton has 30149 states and 46322 transitions. Word has length 315 [2019-09-08 13:09:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:04,961 INFO L475 AbstractCegarLoop]: Abstraction has 30149 states and 46322 transitions. [2019-09-08 13:09:04,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 30149 states and 46322 transitions. [2019-09-08 13:09:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 13:09:05,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:05,007 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,008 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:05,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1992072000, now seen corresponding path program 1 times [2019-09-08 13:09:05,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:05,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:05,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:05,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:05,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:05,405 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,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:05,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:05,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:05,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:05,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:05,408 INFO L87 Difference]: Start difference. First operand 30149 states and 46322 transitions. Second operand 3 states. [2019-09-08 13:09:06,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:06,936 INFO L93 Difference]: Finished difference Result 85572 states and 131249 transitions. [2019-09-08 13:09:06,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:06,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-08 13:09:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:07,047 INFO L225 Difference]: With dead ends: 85572 [2019-09-08 13:09:07,047 INFO L226 Difference]: Without dead ends: 55668 [2019-09-08 13:09:07,113 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,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55668 states. [2019-09-08 13:09:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55668 to 55666. [2019-09-08 13:09:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55666 states. [2019-09-08 13:09:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55666 states to 55666 states and 84932 transitions. [2019-09-08 13:09:10,314 INFO L78 Accepts]: Start accepts. Automaton has 55666 states and 84932 transitions. Word has length 316 [2019-09-08 13:09:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:10,315 INFO L475 AbstractCegarLoop]: Abstraction has 55666 states and 84932 transitions. [2019-09-08 13:09:10,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand 55666 states and 84932 transitions. [2019-09-08 13:09:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 13:09:10,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:10,369 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,369 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1060367773, now seen corresponding path program 1 times [2019-09-08 13:09:10,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:10,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:10,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:10,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:10,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:10,718 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:10,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:10,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:10,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:10,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:10,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:10,720 INFO L87 Difference]: Start difference. First operand 55666 states and 84932 transitions. Second operand 4 states. [2019-09-08 13:09:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:14,097 INFO L93 Difference]: Finished difference Result 162549 states and 247788 transitions. [2019-09-08 13:09:14,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:09:14,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-08 13:09:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:14,234 INFO L225 Difference]: With dead ends: 162549 [2019-09-08 13:09:14,234 INFO L226 Difference]: Without dead ends: 107423 [2019-09-08 13:09:14,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107423 states. [2019-09-08 13:09:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107423 to 55901. [2019-09-08 13:09:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55901 states. [2019-09-08 13:09:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55901 states to 55901 states and 85320 transitions. [2019-09-08 13:09:18,633 INFO L78 Accepts]: Start accepts. Automaton has 55901 states and 85320 transitions. Word has length 316 [2019-09-08 13:09:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:18,633 INFO L475 AbstractCegarLoop]: Abstraction has 55901 states and 85320 transitions. [2019-09-08 13:09:18,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 55901 states and 85320 transitions. [2019-09-08 13:09:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:09:18,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:18,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,683 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:18,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:18,684 INFO L82 PathProgramCache]: Analyzing trace with hash 26814646, now seen corresponding path program 1 times [2019-09-08 13:09:18,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:18,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:18,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:18,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:18,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:18,843 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:18,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:18,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:18,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:18,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:18,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:18,845 INFO L87 Difference]: Start difference. First operand 55901 states and 85320 transitions. Second operand 3 states. [2019-09-08 13:09:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:22,112 INFO L93 Difference]: Finished difference Result 144969 states and 222842 transitions. [2019-09-08 13:09:22,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:22,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 13:09:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:22,243 INFO L225 Difference]: With dead ends: 144969 [2019-09-08 13:09:22,243 INFO L226 Difference]: Without dead ends: 90735 [2019-09-08 13:09:22,319 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:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90735 states. [2019-09-08 13:09:26,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90735 to 70613. [2019-09-08 13:09:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70613 states. [2019-09-08 13:09:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70613 states to 70613 states and 109508 transitions. [2019-09-08 13:09:26,841 INFO L78 Accepts]: Start accepts. Automaton has 70613 states and 109508 transitions. Word has length 318 [2019-09-08 13:09:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:26,842 INFO L475 AbstractCegarLoop]: Abstraction has 70613 states and 109508 transitions. [2019-09-08 13:09:26,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 70613 states and 109508 transitions. [2019-09-08 13:09:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:09:26,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:26,884 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,884 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:26,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:26,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1870282559, now seen corresponding path program 1 times [2019-09-08 13:09:26,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:26,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:26,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:26,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:26,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:27,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:09:27,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:27,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:27,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:27,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:27,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:27,033 INFO L87 Difference]: Start difference. First operand 70613 states and 109508 transitions. Second operand 3 states. [2019-09-08 13:09:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:31,806 INFO L93 Difference]: Finished difference Result 210269 states and 325805 transitions. [2019-09-08 13:09:31,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:31,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 13:09:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:31,992 INFO L225 Difference]: With dead ends: 210269 [2019-09-08 13:09:31,993 INFO L226 Difference]: Without dead ends: 140459 [2019-09-08 13:09:32,062 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,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140459 states. [2019-09-08 13:09:37,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140459 to 70717. [2019-09-08 13:09:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70717 states. [2019-09-08 13:09:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70717 states to 70717 states and 109651 transitions. [2019-09-08 13:09:38,028 INFO L78 Accepts]: Start accepts. Automaton has 70717 states and 109651 transitions. Word has length 318 [2019-09-08 13:09:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:38,028 INFO L475 AbstractCegarLoop]: Abstraction has 70717 states and 109651 transitions. [2019-09-08 13:09:38,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 70717 states and 109651 transitions. [2019-09-08 13:09:38,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-08 13:09:38,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:38,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,062 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:38,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:38,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1807698497, now seen corresponding path program 1 times [2019-09-08 13:09:38,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:38,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:38,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:38,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:38,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:38,231 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:38,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:38,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:38,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:38,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:38,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:38,233 INFO L87 Difference]: Start difference. First operand 70717 states and 109651 transitions. Second operand 3 states. [2019-09-08 13:09:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:45,592 INFO L93 Difference]: Finished difference Result 210401 states and 325971 transitions. [2019-09-08 13:09:45,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:45,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-09-08 13:09:45,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:45,758 INFO L225 Difference]: With dead ends: 210401 [2019-09-08 13:09:45,758 INFO L226 Difference]: Without dead ends: 140584 [2019-09-08 13:09:45,812 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:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140584 states. [2019-09-08 13:09:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140584 to 70842. [2019-09-08 13:09:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70842 states. [2019-09-08 13:09:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70842 states to 70842 states and 109797 transitions. [2019-09-08 13:09:49,358 INFO L78 Accepts]: Start accepts. Automaton has 70842 states and 109797 transitions. Word has length 319 [2019-09-08 13:09:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:49,358 INFO L475 AbstractCegarLoop]: Abstraction has 70842 states and 109797 transitions. [2019-09-08 13:09:49,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 70842 states and 109797 transitions. [2019-09-08 13:09:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:09:49,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:49,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,408 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1740228124, now seen corresponding path program 1 times [2019-09-08 13:09:49,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:49,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:49,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:49,578 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:49,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:49,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:49,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:49,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:49,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:49,580 INFO L87 Difference]: Start difference. First operand 70842 states and 109797 transitions. Second operand 3 states. [2019-09-08 13:09:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:54,676 INFO L93 Difference]: Finished difference Result 181766 states and 283799 transitions. [2019-09-08 13:09:54,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:54,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 13:09:54,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:54,816 INFO L225 Difference]: With dead ends: 181766 [2019-09-08 13:09:54,816 INFO L226 Difference]: Without dead ends: 113132 [2019-09-08 13:09:54,872 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:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113132 states. [2019-09-08 13:10:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113132 to 97226. [2019-09-08 13:10:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97226 states. [2019-09-08 13:10:00,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97226 states to 97226 states and 152957 transitions. [2019-09-08 13:10:00,420 INFO L78 Accepts]: Start accepts. Automaton has 97226 states and 152957 transitions. Word has length 320 [2019-09-08 13:10:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:00,421 INFO L475 AbstractCegarLoop]: Abstraction has 97226 states and 152957 transitions. [2019-09-08 13:10:00,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 97226 states and 152957 transitions. [2019-09-08 13:10:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:10:00,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:00,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,458 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:00,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:00,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1941514580, now seen corresponding path program 1 times [2019-09-08 13:10:00,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:00,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:00,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:01,022 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:01,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:01,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:10:01,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:10:01,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:10:01,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:10:01,025 INFO L87 Difference]: Start difference. First operand 97226 states and 152957 transitions. Second operand 4 states. [2019-09-08 13:10:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:07,939 INFO L93 Difference]: Finished difference Result 195819 states and 307963 transitions. [2019-09-08 13:10:07,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:10:07,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-08 13:10:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:08,078 INFO L225 Difference]: With dead ends: 195819 [2019-09-08 13:10:08,079 INFO L226 Difference]: Without dead ends: 98116 [2019-09-08 13:10:08,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:10:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98116 states. [2019-09-08 13:10:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98116 to 98114. [2019-09-08 13:10:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98114 states. [2019-09-08 13:10:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98114 states to 98114 states and 153494 transitions. [2019-09-08 13:10:13,573 INFO L78 Accepts]: Start accepts. Automaton has 98114 states and 153494 transitions. Word has length 320 [2019-09-08 13:10:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:13,574 INFO L475 AbstractCegarLoop]: Abstraction has 98114 states and 153494 transitions. [2019-09-08 13:10:13,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:10:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 98114 states and 153494 transitions. [2019-09-08 13:10:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 13:10:13,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:13,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,619 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash 198924753, now seen corresponding path program 1 times [2019-09-08 13:10:13,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:13,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:13,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:13,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:13,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:14,055 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:14,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:14,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:10:14,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:10:14,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:10:14,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:10:14,057 INFO L87 Difference]: Start difference. First operand 98114 states and 153494 transitions. Second operand 9 states. [2019-09-08 13:11:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:07,158 INFO L93 Difference]: Finished difference Result 795512 states and 1258529 transitions. [2019-09-08 13:11:07,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 13:11:07,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 321 [2019-09-08 13:11:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:08,460 INFO L225 Difference]: With dead ends: 795512 [2019-09-08 13:11:08,460 INFO L226 Difference]: Without dead ends: 758022 [2019-09-08 13:11:08,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=1112, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 13:11:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758022 states. [2019-09-08 13:11:36,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758022 to 299634. [2019-09-08 13:11:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299634 states. [2019-09-08 13:11:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299634 states to 299634 states and 469234 transitions. [2019-09-08 13:11:37,150 INFO L78 Accepts]: Start accepts. Automaton has 299634 states and 469234 transitions. Word has length 321 [2019-09-08 13:11:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:37,150 INFO L475 AbstractCegarLoop]: Abstraction has 299634 states and 469234 transitions. [2019-09-08 13:11:37,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:11:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 299634 states and 469234 transitions. [2019-09-08 13:11:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 13:11:37,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:37,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,264 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:37,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:37,265 INFO L82 PathProgramCache]: Analyzing trace with hash 20753511, now seen corresponding path program 1 times [2019-09-08 13:11:37,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:37,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:37,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:37,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:37,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:37,806 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:37,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:37,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 13:11:37,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 13:11:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 13:11:37,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 13:11:37,808 INFO L87 Difference]: Start difference. First operand 299634 states and 469234 transitions. Second operand 10 states. [2019-09-08 13:12:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:25,918 INFO L93 Difference]: Finished difference Result 712804 states and 1129431 transitions. [2019-09-08 13:12:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:12:25,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 321 [2019-09-08 13:12:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:26,765 INFO L225 Difference]: With dead ends: 712804 [2019-09-08 13:12:26,765 INFO L226 Difference]: Without dead ends: 537298 [2019-09-08 13:12:26,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-08 13:12:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537298 states. [2019-09-08 13:12:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537298 to 214570. [2019-09-08 13:12:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214570 states. [2019-09-08 13:12:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214570 states to 214570 states and 333470 transitions. [2019-09-08 13:12:53,681 INFO L78 Accepts]: Start accepts. Automaton has 214570 states and 333470 transitions. Word has length 321 [2019-09-08 13:12:53,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:12:53,682 INFO L475 AbstractCegarLoop]: Abstraction has 214570 states and 333470 transitions. [2019-09-08 13:12:53,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 13:12:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 214570 states and 333470 transitions. [2019-09-08 13:12:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 13:12:53,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:12:53,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:53,769 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:12:53,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:12:53,769 INFO L82 PathProgramCache]: Analyzing trace with hash 461727222, now seen corresponding path program 1 times [2019-09-08 13:12:53,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:12:53,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:12:53,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:53,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:12:53,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:12:54,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:12:54,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:12:54,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:12:54,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:12:54,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:12:54,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:12:54,290 INFO L87 Difference]: Start difference. First operand 214570 states and 333470 transitions. Second operand 4 states. [2019-09-08 13:13:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:13:32,091 INFO L93 Difference]: Finished difference Result 633083 states and 983730 transitions. [2019-09-08 13:13:32,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:13:32,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2019-09-08 13:13:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:13:32,851 INFO L225 Difference]: With dead ends: 633083 [2019-09-08 13:13:32,852 INFO L226 Difference]: Without dead ends: 418835 [2019-09-08 13:13:33,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:13:33,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418835 states. [2019-09-08 13:14:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418835 to 418833. [2019-09-08 13:14:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418833 states. [2019-09-08 13:14:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418833 states to 418833 states and 647941 transitions. [2019-09-08 13:14:13,454 INFO L78 Accepts]: Start accepts. Automaton has 418833 states and 647941 transitions. Word has length 321 [2019-09-08 13:14:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:13,454 INFO L475 AbstractCegarLoop]: Abstraction has 418833 states and 647941 transitions. [2019-09-08 13:14:13,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:14:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 418833 states and 647941 transitions. [2019-09-08 13:14:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:14:13,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:13,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,607 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:13,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash -925504248, now seen corresponding path program 1 times [2019-09-08 13:14:13,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:13,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:13,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:13,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:13,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:13,898 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:14:13,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:13,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:14:13,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:14:13,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:14:13,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:14:13,900 INFO L87 Difference]: Start difference. First operand 418833 states and 647941 transitions. Second operand 4 states. [2019-09-08 13:15:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:31,838 INFO L93 Difference]: Finished difference Result 1253843 states and 1939599 transitions. [2019-09-08 13:15:31,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:15:31,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-08 13:15:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:33,368 INFO L225 Difference]: With dead ends: 1253843 [2019-09-08 13:15:33,368 INFO L226 Difference]: Without dead ends: 837064 [2019-09-08 13:15:33,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:15:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837064 states. [2019-09-08 13:16:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837064 to 419862. [2019-09-08 13:16:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419862 states. [2019-09-08 13:16:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419862 states to 419862 states and 649665 transitions. [2019-09-08 13:16:25,355 INFO L78 Accepts]: Start accepts. Automaton has 419862 states and 649665 transitions. Word has length 322 [2019-09-08 13:16:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:25,356 INFO L475 AbstractCegarLoop]: Abstraction has 419862 states and 649665 transitions. [2019-09-08 13:16:25,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:16:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 419862 states and 649665 transitions. [2019-09-08 13:16:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:16:25,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:25,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,517 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:25,517 INFO L82 PathProgramCache]: Analyzing trace with hash -502421795, now seen corresponding path program 1 times [2019-09-08 13:16:25,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:25,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:25,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:25,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:25,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:25,766 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:16:25,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:25,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:16:25,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:16:25,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:16:25,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:16:25,769 INFO L87 Difference]: Start difference. First operand 419862 states and 649665 transitions. Second operand 3 states. [2019-09-08 13:17:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:43,077 INFO L93 Difference]: Finished difference Result 1237519 states and 1912545 transitions. [2019-09-08 13:17:43,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:43,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 13:17:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:44,463 INFO L225 Difference]: With dead ends: 1237519 [2019-09-08 13:17:44,463 INFO L226 Difference]: Without dead ends: 819496 [2019-09-08 13:17:44,853 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:17:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819496 states. [2019-09-08 13:19:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819496 to 819494. [2019-09-08 13:19:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819494 states. [2019-09-08 13:19:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819494 states to 819494 states and 1260268 transitions. [2019-09-08 13:19:24,519 INFO L78 Accepts]: Start accepts. Automaton has 819494 states and 1260268 transitions. Word has length 322 [2019-09-08 13:19:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:24,519 INFO L475 AbstractCegarLoop]: Abstraction has 819494 states and 1260268 transitions. [2019-09-08 13:19:24,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 819494 states and 1260268 transitions. [2019-09-08 13:19:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 13:19:24,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:24,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:24,816 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:24,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:24,817 INFO L82 PathProgramCache]: Analyzing trace with hash 451991542, now seen corresponding path program 1 times [2019-09-08 13:19:24,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:24,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:24,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:24,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:24,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:25,017 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:19:25,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:25,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:25,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:25,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:25,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:25,019 INFO L87 Difference]: Start difference. First operand 819494 states and 1260268 transitions. Second operand 3 states.