java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:59:20,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:59:20,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:59:20,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:59:20,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:59:20,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:59:20,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:59:20,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:59:20,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:59:20,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:59:20,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:59:20,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:59:20,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:59:20,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:59:20,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:59:20,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:59:20,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:59:20,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:59:20,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:59:20,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:59:20,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:59:20,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:59:20,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:59:20,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:59:20,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:59:20,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:59:20,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:59:20,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:59:20,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:59:20,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:59:20,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:59:20,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:59:20,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:59:20,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:59:20,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:59:20,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:59:20,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:59:20,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:59:20,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:59:20,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:59:20,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:59:20,168 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 09:59:20,182 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:59:20,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:59:20,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:59:20,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:59:20,184 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:59:20,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:59:20,184 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:59:20,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:59:20,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:59:20,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:59:20,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:59:20,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:59:20,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:59:20,186 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:59:20,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:59:20,186 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:59:20,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:59:20,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:59:20,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:59:20,187 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:59:20,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:59:20,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:59:20,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:59:20,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:59:20,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:59:20,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:59:20,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:59:20,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:59:20,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:59:20,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:59:20,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:59:20,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:59:20,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:59:20,244 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:59:20,245 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:59:20,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef74661b5/f07dad3e46b94448803ca0463dfd96b1/FLAG8acc6eba0 [2019-09-08 09:59:20,949 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:59:20,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:59:20,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef74661b5/f07dad3e46b94448803ca0463dfd96b1/FLAG8acc6eba0 [2019-09-08 09:59:21,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef74661b5/f07dad3e46b94448803ca0463dfd96b1 [2019-09-08 09:59:21,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:59:21,088 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:59:21,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:59:21,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:59:21,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:59:21,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:59:21" (1/1) ... [2019-09-08 09:59:21,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13acec7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:59:21, skipping insertion in model container [2019-09-08 09:59:21,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:59:21" (1/1) ... [2019-09-08 09:59:21,108 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:59:21,268 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:59:22,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:59:22,772 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:59:23,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:59:23,923 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:59:23,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:59:23 WrapperNode [2019-09-08 09:59:23,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:59:23,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:59:23,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:59:23,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:59:23,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:59:23" (1/1) ... [2019-09-08 09:59:23,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:59:23" (1/1) ... [2019-09-08 09:59:24,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:59:23" (1/1) ... [2019-09-08 09:59:24,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:59:23" (1/1) ... [2019-09-08 09:59:24,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:59:23" (1/1) ... [2019-09-08 09:59:24,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:59:23" (1/1) ... [2019-09-08 09:59:24,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:59:23" (1/1) ... [2019-09-08 09:59:24,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:59:24,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:59:24,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:59:24,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:59:24,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:59:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:59:24,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:59:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:59:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:59:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:59:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:59:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:59:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:59:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:59:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:59:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:59:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:59:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:59:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:59:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:59:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:59:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:59:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:59:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:59:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:59:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:59:27,523 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:59:27,524 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:59:27,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:59:27 BoogieIcfgContainer [2019-09-08 09:59:27,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:59:27,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:59:27,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:59:27,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:59:27,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:59:21" (1/3) ... [2019-09-08 09:59:27,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76febd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:59:27, skipping insertion in model container [2019-09-08 09:59:27,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:59:23" (2/3) ... [2019-09-08 09:59:27,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76febd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:59:27, skipping insertion in model container [2019-09-08 09:59:27,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:59:27" (3/3) ... [2019-09-08 09:59:27,535 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 09:59:27,546 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:59:27,556 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 09:59:27,575 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 09:59:27,615 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:59:27,616 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:59:27,616 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:59:27,617 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:59:27,617 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:59:27,617 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:59:27,617 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:59:27,617 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:59:27,617 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:59:27,653 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states. [2019-09-08 09:59:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:59:27,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:27,698 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] [2019-09-08 09:59:27,701 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:27,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1089815166, now seen corresponding path program 1 times [2019-09-08 09:59:27,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:27,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:27,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:27,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:27,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:28,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:28,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:59:28,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:59:28,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:59:28,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:28,902 INFO L87 Difference]: Start difference. First operand 918 states. Second operand 3 states. [2019-09-08 09:59:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:29,269 INFO L93 Difference]: Finished difference Result 1584 states and 2837 transitions. [2019-09-08 09:59:29,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:59:29,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-08 09:59:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:29,310 INFO L225 Difference]: With dead ends: 1584 [2019-09-08 09:59:29,311 INFO L226 Difference]: Without dead ends: 1314 [2019-09-08 09:59:29,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-09-08 09:59:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1312. [2019-09-08 09:59:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2019-09-08 09:59:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1997 transitions. [2019-09-08 09:59:29,479 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1997 transitions. Word has length 304 [2019-09-08 09:59:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:29,483 INFO L475 AbstractCegarLoop]: Abstraction has 1312 states and 1997 transitions. [2019-09-08 09:59:29,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:59:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1997 transitions. [2019-09-08 09:59:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:59:29,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:29,494 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] [2019-09-08 09:59:29,495 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:29,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:29,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1639083294, now seen corresponding path program 1 times [2019-09-08 09:59:29,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:29,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:29,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:29,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:29,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:29,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:29,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:59:29,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:59:29,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:59:29,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:29,921 INFO L87 Difference]: Start difference. First operand 1312 states and 1997 transitions. Second operand 3 states. [2019-09-08 09:59:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:30,291 INFO L93 Difference]: Finished difference Result 2503 states and 3858 transitions. [2019-09-08 09:59:30,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:59:30,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-08 09:59:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:30,308 INFO L225 Difference]: With dead ends: 2503 [2019-09-08 09:59:30,308 INFO L226 Difference]: Without dead ends: 2132 [2019-09-08 09:59:30,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-09-08 09:59:30,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2130. [2019-09-08 09:59:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-09-08 09:59:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3258 transitions. [2019-09-08 09:59:30,401 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3258 transitions. Word has length 304 [2019-09-08 09:59:30,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:30,402 INFO L475 AbstractCegarLoop]: Abstraction has 2130 states and 3258 transitions. [2019-09-08 09:59:30,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:59:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3258 transitions. [2019-09-08 09:59:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:59:30,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:30,416 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] [2019-09-08 09:59:30,417 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:30,418 INFO L82 PathProgramCache]: Analyzing trace with hash -94104104, now seen corresponding path program 1 times [2019-09-08 09:59:30,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:30,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:30,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:31,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:31,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:59:31,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:59:31,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:59:31,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:59:31,420 INFO L87 Difference]: Start difference. First operand 2130 states and 3258 transitions. Second operand 4 states. [2019-09-08 09:59:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:31,838 INFO L93 Difference]: Finished difference Result 6307 states and 9639 transitions. [2019-09-08 09:59:31,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:59:31,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-09-08 09:59:31,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:31,865 INFO L225 Difference]: With dead ends: 6307 [2019-09-08 09:59:31,866 INFO L226 Difference]: Without dead ends: 4192 [2019-09-08 09:59:31,880 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 09:59:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2019-09-08 09:59:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 4078. [2019-09-08 09:59:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2019-09-08 09:59:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 6229 transitions. [2019-09-08 09:59:32,085 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 6229 transitions. Word has length 304 [2019-09-08 09:59:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:32,086 INFO L475 AbstractCegarLoop]: Abstraction has 4078 states and 6229 transitions. [2019-09-08 09:59:32,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:59:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 6229 transitions. [2019-09-08 09:59:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:59:32,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:32,096 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] [2019-09-08 09:59:32,097 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:32,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1862797433, now seen corresponding path program 1 times [2019-09-08 09:59:32,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:32,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:32,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:32,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:32,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:32,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:32,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:59:32,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:59:32,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:59:32,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:32,368 INFO L87 Difference]: Start difference. First operand 4078 states and 6229 transitions. Second operand 3 states. [2019-09-08 09:59:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:32,788 INFO L93 Difference]: Finished difference Result 11950 states and 18209 transitions. [2019-09-08 09:59:32,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:59:32,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 09:59:32,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:32,828 INFO L225 Difference]: With dead ends: 11950 [2019-09-08 09:59:32,829 INFO L226 Difference]: Without dead ends: 8001 [2019-09-08 09:59:32,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:32,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2019-09-08 09:59:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 7887. [2019-09-08 09:59:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7887 states. [2019-09-08 09:59:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7887 states to 7887 states and 11998 transitions. [2019-09-08 09:59:33,183 INFO L78 Accepts]: Start accepts. Automaton has 7887 states and 11998 transitions. Word has length 306 [2019-09-08 09:59:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:33,184 INFO L475 AbstractCegarLoop]: Abstraction has 7887 states and 11998 transitions. [2019-09-08 09:59:33,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:59:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 7887 states and 11998 transitions. [2019-09-08 09:59:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:59:33,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:33,205 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] [2019-09-08 09:59:33,206 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:33,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:33,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1026459764, now seen corresponding path program 1 times [2019-09-08 09:59:33,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:33,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:33,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:33,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:33,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:33,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:59:33,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:59:33,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:59:33,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:33,365 INFO L87 Difference]: Start difference. First operand 7887 states and 11998 transitions. Second operand 3 states. [2019-09-08 09:59:33,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:33,928 INFO L93 Difference]: Finished difference Result 23586 states and 35870 transitions. [2019-09-08 09:59:33,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:59:33,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 09:59:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:34,012 INFO L225 Difference]: With dead ends: 23586 [2019-09-08 09:59:34,013 INFO L226 Difference]: Without dead ends: 15741 [2019-09-08 09:59:34,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15741 states. [2019-09-08 09:59:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15741 to 7906. [2019-09-08 09:59:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7906 states. [2019-09-08 09:59:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7906 states to 7906 states and 12026 transitions. [2019-09-08 09:59:34,512 INFO L78 Accepts]: Start accepts. Automaton has 7906 states and 12026 transitions. Word has length 306 [2019-09-08 09:59:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:34,513 INFO L475 AbstractCegarLoop]: Abstraction has 7906 states and 12026 transitions. [2019-09-08 09:59:34,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:59:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7906 states and 12026 transitions. [2019-09-08 09:59:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 09:59:34,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:34,538 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] [2019-09-08 09:59:34,539 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:34,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:34,540 INFO L82 PathProgramCache]: Analyzing trace with hash -454298708, now seen corresponding path program 1 times [2019-09-08 09:59:34,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:34,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:34,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:34,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:34,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:34,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:34,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:59:34,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:59:34,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:59:34,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:34,702 INFO L87 Difference]: Start difference. First operand 7906 states and 12026 transitions. Second operand 3 states. [2019-09-08 09:59:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:35,245 INFO L93 Difference]: Finished difference Result 23605 states and 35891 transitions. [2019-09-08 09:59:35,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:59:35,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-09-08 09:59:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:35,284 INFO L225 Difference]: With dead ends: 23605 [2019-09-08 09:59:35,284 INFO L226 Difference]: Without dead ends: 15759 [2019-09-08 09:59:35,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:35,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15759 states. [2019-09-08 09:59:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15759 to 7924. [2019-09-08 09:59:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7924 states. [2019-09-08 09:59:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7924 states to 7924 states and 12047 transitions. [2019-09-08 09:59:35,772 INFO L78 Accepts]: Start accepts. Automaton has 7924 states and 12047 transitions. Word has length 307 [2019-09-08 09:59:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:35,774 INFO L475 AbstractCegarLoop]: Abstraction has 7924 states and 12047 transitions. [2019-09-08 09:59:35,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:59:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 7924 states and 12047 transitions. [2019-09-08 09:59:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:59:35,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:35,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] [2019-09-08 09:59:35,794 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:35,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1587691774, now seen corresponding path program 1 times [2019-09-08 09:59:35,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:35,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:35,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:35,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:35,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:36,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:36,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:59:36,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:59:36,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:59:36,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:36,171 INFO L87 Difference]: Start difference. First operand 7924 states and 12047 transitions. Second operand 3 states. [2019-09-08 09:59:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:36,878 INFO L93 Difference]: Finished difference Result 22320 states and 33834 transitions. [2019-09-08 09:59:36,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:59:36,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 09:59:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:36,919 INFO L225 Difference]: With dead ends: 22320 [2019-09-08 09:59:36,919 INFO L226 Difference]: Without dead ends: 14641 [2019-09-08 09:59:36,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14641 states. [2019-09-08 09:59:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14641 to 14527. [2019-09-08 09:59:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14527 states. [2019-09-08 09:59:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14527 states to 14527 states and 21929 transitions. [2019-09-08 09:59:38,341 INFO L78 Accepts]: Start accepts. Automaton has 14527 states and 21929 transitions. Word has length 308 [2019-09-08 09:59:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:38,342 INFO L475 AbstractCegarLoop]: Abstraction has 14527 states and 21929 transitions. [2019-09-08 09:59:38,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:59:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 14527 states and 21929 transitions. [2019-09-08 09:59:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:59:38,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:38,371 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] [2019-09-08 09:59:38,371 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2070396511, now seen corresponding path program 1 times [2019-09-08 09:59:38,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:38,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:38,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:38,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:38,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:38,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:38,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:38,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:59:38,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:59:38,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:59:38,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:59:38,747 INFO L87 Difference]: Start difference. First operand 14527 states and 21929 transitions. Second operand 4 states. [2019-09-08 09:59:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:39,989 INFO L93 Difference]: Finished difference Result 41738 states and 62794 transitions. [2019-09-08 09:59:39,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:59:39,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-08 09:59:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:40,052 INFO L225 Difference]: With dead ends: 41738 [2019-09-08 09:59:40,052 INFO L226 Difference]: Without dead ends: 27751 [2019-09-08 09:59:40,082 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 09:59:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27751 states. [2019-09-08 09:59:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27751 to 14762. [2019-09-08 09:59:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14762 states. [2019-09-08 09:59:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14762 states to 14762 states and 22317 transitions. [2019-09-08 09:59:40,976 INFO L78 Accepts]: Start accepts. Automaton has 14762 states and 22317 transitions. Word has length 308 [2019-09-08 09:59:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:40,976 INFO L475 AbstractCegarLoop]: Abstraction has 14762 states and 22317 transitions. [2019-09-08 09:59:40,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:59:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 14762 states and 22317 transitions. [2019-09-08 09:59:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:59:41,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:41,005 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] [2019-09-08 09:59:41,005 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:41,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:41,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1042389551, now seen corresponding path program 1 times [2019-09-08 09:59:41,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:41,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:41,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:41,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:41,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:41,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:41,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:59:41,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:59:41,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:59:41,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:41,142 INFO L87 Difference]: Start difference. First operand 14762 states and 22317 transitions. Second operand 3 states. [2019-09-08 09:59:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:42,037 INFO L93 Difference]: Finished difference Result 42716 states and 64232 transitions. [2019-09-08 09:59:42,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:59:42,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-08 09:59:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:42,097 INFO L225 Difference]: With dead ends: 42716 [2019-09-08 09:59:42,098 INFO L226 Difference]: Without dead ends: 28757 [2019-09-08 09:59:42,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:42,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28757 states. [2019-09-08 09:59:43,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28757 to 14866. [2019-09-08 09:59:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2019-09-08 09:59:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 22460 transitions. [2019-09-08 09:59:43,342 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 22460 transitions. Word has length 310 [2019-09-08 09:59:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:43,343 INFO L475 AbstractCegarLoop]: Abstraction has 14866 states and 22460 transitions. [2019-09-08 09:59:43,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:59:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 22460 transitions. [2019-09-08 09:59:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 09:59:43,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:43,367 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] [2019-09-08 09:59:43,367 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:43,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:43,368 INFO L82 PathProgramCache]: Analyzing trace with hash 209482193, now seen corresponding path program 1 times [2019-09-08 09:59:43,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:43,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:43,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:43,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:43,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:43,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:43,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:59:43,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:59:43,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:59:43,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:43,520 INFO L87 Difference]: Start difference. First operand 14866 states and 22460 transitions. Second operand 3 states. [2019-09-08 09:59:45,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:45,015 INFO L93 Difference]: Finished difference Result 42848 states and 64398 transitions. [2019-09-08 09:59:45,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:59:45,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-08 09:59:45,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:45,065 INFO L225 Difference]: With dead ends: 42848 [2019-09-08 09:59:45,065 INFO L226 Difference]: Without dead ends: 28882 [2019-09-08 09:59:45,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:45,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28882 states. [2019-09-08 09:59:45,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28882 to 14991. [2019-09-08 09:59:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14991 states. [2019-09-08 09:59:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14991 states to 14991 states and 22606 transitions. [2019-09-08 09:59:45,899 INFO L78 Accepts]: Start accepts. Automaton has 14991 states and 22606 transitions. Word has length 311 [2019-09-08 09:59:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:45,900 INFO L475 AbstractCegarLoop]: Abstraction has 14991 states and 22606 transitions. [2019-09-08 09:59:45,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:59:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 14991 states and 22606 transitions. [2019-09-08 09:59:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 09:59:45,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:45,917 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 09:59:45,918 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:45,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:45,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1671112126, now seen corresponding path program 1 times [2019-09-08 09:59:45,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:45,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:45,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:45,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:45,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:46,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:46,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:59:46,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:59:46,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:59:46,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:59:46,294 INFO L87 Difference]: Start difference. First operand 14991 states and 22606 transitions. Second operand 4 states. [2019-09-08 09:59:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:47,119 INFO L93 Difference]: Finished difference Result 28065 states and 42185 transitions. [2019-09-08 09:59:47,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:59:47,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-08 09:59:47,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:47,134 INFO L225 Difference]: With dead ends: 28065 [2019-09-08 09:59:47,134 INFO L226 Difference]: Without dead ends: 13937 [2019-09-08 09:59:47,151 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 09:59:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13937 states. [2019-09-08 09:59:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13937 to 13917. [2019-09-08 09:59:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13917 states. [2019-09-08 09:59:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13917 states to 13917 states and 20996 transitions. [2019-09-08 09:59:47,766 INFO L78 Accepts]: Start accepts. Automaton has 13917 states and 20996 transitions. Word has length 312 [2019-09-08 09:59:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:47,767 INFO L475 AbstractCegarLoop]: Abstraction has 13917 states and 20996 transitions. [2019-09-08 09:59:47,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:59:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 13917 states and 20996 transitions. [2019-09-08 09:59:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 09:59:47,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:47,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:59:47,780 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:47,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:47,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1258337204, now seen corresponding path program 1 times [2019-09-08 09:59:47,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:47,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:47,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:47,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:48,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:48,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:59:48,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:59:48,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:59:48,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:48,037 INFO L87 Difference]: Start difference. First operand 13917 states and 20996 transitions. Second operand 3 states. [2019-09-08 09:59:49,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:49,308 INFO L93 Difference]: Finished difference Result 28634 states and 43757 transitions. [2019-09-08 09:59:49,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:59:49,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-09-08 09:59:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:49,337 INFO L225 Difference]: With dead ends: 28634 [2019-09-08 09:59:49,338 INFO L226 Difference]: Without dead ends: 24743 [2019-09-08 09:59:49,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24743 states. [2019-09-08 09:59:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24743 to 24705. [2019-09-08 09:59:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24705 states. [2019-09-08 09:59:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24705 states to 24705 states and 37290 transitions. [2019-09-08 09:59:50,371 INFO L78 Accepts]: Start accepts. Automaton has 24705 states and 37290 transitions. Word has length 313 [2019-09-08 09:59:50,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:50,372 INFO L475 AbstractCegarLoop]: Abstraction has 24705 states and 37290 transitions. [2019-09-08 09:59:50,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:59:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 24705 states and 37290 transitions. [2019-09-08 09:59:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 09:59:50,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:50,393 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] [2019-09-08 09:59:50,394 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:50,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1258675828, now seen corresponding path program 1 times [2019-09-08 09:59:50,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:50,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:50,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:50,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:50,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:59:51,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:51,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 09:59:51,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:59:51,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:59:51,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:59:51,105 INFO L87 Difference]: Start difference. First operand 24705 states and 37290 transitions. Second operand 9 states. [2019-09-08 09:59:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:59:57,909 INFO L93 Difference]: Finished difference Result 82946 states and 129411 transitions. [2019-09-08 09:59:57,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 09:59:57,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 313 [2019-09-08 09:59:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:59:57,990 INFO L225 Difference]: With dead ends: 82946 [2019-09-08 09:59:57,990 INFO L226 Difference]: Without dead ends: 60018 [2019-09-08 09:59:58,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-08 09:59:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60018 states. [2019-09-08 10:00:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60018 to 37656. [2019-09-08 10:00:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37656 states. [2019-09-08 10:00:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37656 states to 37656 states and 57943 transitions. [2019-09-08 10:00:00,204 INFO L78 Accepts]: Start accepts. Automaton has 37656 states and 57943 transitions. Word has length 313 [2019-09-08 10:00:00,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:00:00,205 INFO L475 AbstractCegarLoop]: Abstraction has 37656 states and 57943 transitions. [2019-09-08 10:00:00,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:00:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 37656 states and 57943 transitions. [2019-09-08 10:00:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 10:00:00,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:00:00,229 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] [2019-09-08 10:00:00,229 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:00:00,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:00:00,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1601555817, now seen corresponding path program 1 times [2019-09-08 10:00:00,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:00:00,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:00:00,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:00,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:00:00,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:00:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:00:00,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:00:00,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:00:00,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:00:00,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:00:00,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:00:00,786 INFO L87 Difference]: Start difference. First operand 37656 states and 57943 transitions. Second operand 4 states. [2019-09-08 10:00:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:00:05,113 INFO L93 Difference]: Finished difference Result 111336 states and 171106 transitions. [2019-09-08 10:00:05,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:00:05,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2019-09-08 10:00:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:00:05,202 INFO L225 Difference]: With dead ends: 111336 [2019-09-08 10:00:05,203 INFO L226 Difference]: Without dead ends: 73752 [2019-09-08 10:00:05,259 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 10:00:05,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73752 states. [2019-09-08 10:00:10,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73752 to 73588. [2019-09-08 10:00:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73588 states. [2019-09-08 10:00:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73588 states to 73588 states and 112395 transitions. [2019-09-08 10:00:10,831 INFO L78 Accepts]: Start accepts. Automaton has 73588 states and 112395 transitions. Word has length 313 [2019-09-08 10:00:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:00:10,832 INFO L475 AbstractCegarLoop]: Abstraction has 73588 states and 112395 transitions. [2019-09-08 10:00:10,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:00:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 73588 states and 112395 transitions. [2019-09-08 10:00:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-08 10:00:10,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:00:10,877 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 10:00:10,877 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:00:10,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:00:10,878 INFO L82 PathProgramCache]: Analyzing trace with hash 993380925, now seen corresponding path program 1 times [2019-09-08 10:00:10,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:00:10,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:00:10,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:10,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:00:10,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:00:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:00:11,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:00:11,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:00:11,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:00:11,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:00:11,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:00:11,103 INFO L87 Difference]: Start difference. First operand 73588 states and 112395 transitions. Second operand 3 states. [2019-09-08 10:00:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:00:21,221 INFO L93 Difference]: Finished difference Result 216206 states and 330019 transitions. [2019-09-08 10:00:21,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:00:21,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-08 10:00:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:00:21,394 INFO L225 Difference]: With dead ends: 216206 [2019-09-08 10:00:21,395 INFO L226 Difference]: Without dead ends: 143867 [2019-09-08 10:00:21,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:00:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143867 states. [2019-09-08 10:00:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143867 to 143711. [2019-09-08 10:00:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143711 states. [2019-09-08 10:00:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143711 states to 143711 states and 218185 transitions. [2019-09-08 10:00:32,189 INFO L78 Accepts]: Start accepts. Automaton has 143711 states and 218185 transitions. Word has length 315 [2019-09-08 10:00:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:00:32,189 INFO L475 AbstractCegarLoop]: Abstraction has 143711 states and 218185 transitions. [2019-09-08 10:00:32,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:00:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 143711 states and 218185 transitions. [2019-09-08 10:00:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 10:00:32,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:00:32,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] [2019-09-08 10:00:32,265 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:00:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:00:32,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1748366818, now seen corresponding path program 1 times [2019-09-08 10:00:32,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:00:32,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:00:32,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:32,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:00:32,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:00:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:00:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:00:32,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:00:32,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:00:32,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:00:32,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:00:32,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:00:32,524 INFO L87 Difference]: Start difference. First operand 143711 states and 218185 transitions. Second operand 3 states. [2019-09-08 10:00:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:00:49,726 INFO L93 Difference]: Finished difference Result 404732 states and 612834 transitions. [2019-09-08 10:00:49,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:00:49,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-09-08 10:00:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:00:50,175 INFO L225 Difference]: With dead ends: 404732 [2019-09-08 10:00:50,176 INFO L226 Difference]: Without dead ends: 262368 [2019-09-08 10:00:50,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:00:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262368 states. [2019-09-08 10:01:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262368 to 262220. [2019-09-08 10:01:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262220 states. [2019-09-08 10:01:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262220 states to 262220 states and 393909 transitions. [2019-09-08 10:01:11,225 INFO L78 Accepts]: Start accepts. Automaton has 262220 states and 393909 transitions. Word has length 317 [2019-09-08 10:01:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:01:11,226 INFO L475 AbstractCegarLoop]: Abstraction has 262220 states and 393909 transitions. [2019-09-08 10:01:11,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:01:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 262220 states and 393909 transitions. [2019-09-08 10:01:11,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 10:01:11,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:01:11,367 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] [2019-09-08 10:01:11,368 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:01:11,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:01:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash -359898139, now seen corresponding path program 1 times [2019-09-08 10:01:11,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:01:11,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:01:11,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:01:11,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:01:11,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:01:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:01:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:01:11,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:01:11,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:01:11,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:01:11,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:01:11,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:01:11,669 INFO L87 Difference]: Start difference. First operand 262220 states and 393909 transitions. Second operand 4 states. [2019-09-08 10:01:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:01:48,721 INFO L93 Difference]: Finished difference Result 718083 states and 1077444 transitions. [2019-09-08 10:01:48,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:01:48,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2019-09-08 10:01:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:01:49,382 INFO L225 Difference]: With dead ends: 718083 [2019-09-08 10:01:49,382 INFO L226 Difference]: Without dead ends: 459155 [2019-09-08 10:01:49,596 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 10:01:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459155 states. [2019-09-08 10:02:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459155 to 256443. [2019-09-08 10:02:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256443 states. [2019-09-08 10:02:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256443 states to 256443 states and 385212 transitions. [2019-09-08 10:02:15,593 INFO L78 Accepts]: Start accepts. Automaton has 256443 states and 385212 transitions. Word has length 317 [2019-09-08 10:02:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:15,594 INFO L475 AbstractCegarLoop]: Abstraction has 256443 states and 385212 transitions. [2019-09-08 10:02:15,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:02:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 256443 states and 385212 transitions. [2019-09-08 10:02:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 10:02:15,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:15,724 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:15,724 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:15,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:15,724 INFO L82 PathProgramCache]: Analyzing trace with hash -239317031, now seen corresponding path program 1 times [2019-09-08 10:02:15,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:15,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:15,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:15,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:15,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:15,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:15,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:15,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:15,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:15,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:15,859 INFO L87 Difference]: Start difference. First operand 256443 states and 385212 transitions. Second operand 3 states. [2019-09-08 10:02:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:51,436 INFO L93 Difference]: Finished difference Result 702761 states and 1054239 transitions. [2019-09-08 10:02:51,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:51,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 10:02:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:52,174 INFO L225 Difference]: With dead ends: 702761 [2019-09-08 10:02:52,175 INFO L226 Difference]: Without dead ends: 460279 [2019-09-08 10:02:52,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460279 states. [2019-09-08 10:03:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460279 to 256924. [2019-09-08 10:03:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256924 states. [2019-09-08 10:03:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256924 states to 256924 states and 385810 transitions. [2019-09-08 10:03:20,709 INFO L78 Accepts]: Start accepts. Automaton has 256924 states and 385810 transitions. Word has length 320 [2019-09-08 10:03:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:20,709 INFO L475 AbstractCegarLoop]: Abstraction has 256924 states and 385810 transitions. [2019-09-08 10:03:20,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 256924 states and 385810 transitions. [2019-09-08 10:03:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 10:03:20,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:20,849 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 10:03:20,849 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:20,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:20,850 INFO L82 PathProgramCache]: Analyzing trace with hash 206739205, now seen corresponding path program 1 times [2019-09-08 10:03:20,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:20,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:20,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:20,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:20,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:21,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:21,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:21,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:21,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:21,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:21,162 INFO L87 Difference]: Start difference. First operand 256924 states and 385810 transitions. Second operand 4 states. [2019-09-08 10:03:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:43,008 INFO L93 Difference]: Finished difference Result 496104 states and 744631 transitions. [2019-09-08 10:03:43,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:43,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2019-09-08 10:03:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:43,343 INFO L225 Difference]: With dead ends: 496104 [2019-09-08 10:03:43,344 INFO L226 Difference]: Without dead ends: 244492 [2019-09-08 10:03:43,521 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 10:03:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244492 states. [2019-09-08 10:04:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244492 to 244165. [2019-09-08 10:04:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244165 states. [2019-09-08 10:04:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244165 states to 244165 states and 366760 transitions. [2019-09-08 10:04:08,747 INFO L78 Accepts]: Start accepts. Automaton has 244165 states and 366760 transitions. Word has length 321 [2019-09-08 10:04:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:08,747 INFO L475 AbstractCegarLoop]: Abstraction has 244165 states and 366760 transitions. [2019-09-08 10:04:08,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:04:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 244165 states and 366760 transitions. [2019-09-08 10:04:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 10:04:08,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:08,869 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 10:04:08,870 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:08,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:08,870 INFO L82 PathProgramCache]: Analyzing trace with hash -961728584, now seen corresponding path program 1 times [2019-09-08 10:04:08,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:08,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:08,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:08,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:08,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:09,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 10:04:09,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:09,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:04:09,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:04:09,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:04:09,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:09,025 INFO L87 Difference]: Start difference. First operand 244165 states and 366760 transitions. Second operand 3 states. [2019-09-08 10:04:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:50,706 INFO L93 Difference]: Finished difference Result 707098 states and 1061033 transitions. [2019-09-08 10:04:50,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:04:50,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 10:04:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:51,470 INFO L225 Difference]: With dead ends: 707098 [2019-09-08 10:04:51,471 INFO L226 Difference]: Without dead ends: 475490 [2019-09-08 10:04:51,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:04:52,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475490 states. [2019-09-08 10:05:37,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475490 to 475150. [2019-09-08 10:05:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475150 states. [2019-09-08 10:05:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475150 states to 475150 states and 709391 transitions. [2019-09-08 10:05:39,134 INFO L78 Accepts]: Start accepts. Automaton has 475150 states and 709391 transitions. Word has length 322 [2019-09-08 10:05:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:39,134 INFO L475 AbstractCegarLoop]: Abstraction has 475150 states and 709391 transitions. [2019-09-08 10:05:39,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:05:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 475150 states and 709391 transitions. [2019-09-08 10:05:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 10:05:39,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:39,387 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 10:05:39,387 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:39,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:39,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1425793245, now seen corresponding path program 1 times [2019-09-08 10:05:39,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:39,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:39,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:39,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:39,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:05:39,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:39,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:05:39,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:05:39,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:05:39,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:05:39,846 INFO L87 Difference]: Start difference. First operand 475150 states and 709391 transitions. Second operand 8 states. [2019-09-08 10:07:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:45,230 INFO L93 Difference]: Finished difference Result 1578748 states and 2419867 transitions. [2019-09-08 10:07:45,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 10:07:45,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 322 [2019-09-08 10:07:45,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:47,448 INFO L225 Difference]: With dead ends: 1578748 [2019-09-08 10:07:47,448 INFO L226 Difference]: Without dead ends: 1116326 [2019-09-08 10:07:47,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:07:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116326 states. [2019-09-08 10:09:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116326 to 643998. [2019-09-08 10:09:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643998 states. [2019-09-08 10:09:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643998 states to 643998 states and 960945 transitions. [2019-09-08 10:09:19,153 INFO L78 Accepts]: Start accepts. Automaton has 643998 states and 960945 transitions. Word has length 322 [2019-09-08 10:09:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:09:19,154 INFO L475 AbstractCegarLoop]: Abstraction has 643998 states and 960945 transitions. [2019-09-08 10:09:19,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:09:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 643998 states and 960945 transitions. [2019-09-08 10:09:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 10:09:19,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:09:19,409 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 10:09:19,410 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:09:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:09:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash 524219355, now seen corresponding path program 1 times [2019-09-08 10:09:19,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:09:19,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:09:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:09:19,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:09:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:09:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:09:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:09:20,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:09:20,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:09:20,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:09:20,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:09:20,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:09:20,879 INFO L87 Difference]: Start difference. First operand 643998 states and 960945 transitions. Second operand 4 states.