java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:29:52,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:29:52,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:29:52,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:29:52,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:29:52,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:29:52,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:29:52,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:29:52,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:29:52,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:29:52,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:29:52,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:29:52,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:29:52,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:29:52,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:29:52,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:29:52,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:29:52,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:29:52,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:29:52,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:29:52,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:29:52,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:29:52,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:29:52,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:29:52,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:29:52,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:29:52,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:29:52,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:29:52,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:29:52,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:29:52,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:29:52,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:29:52,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:29:52,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:29:52,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:29:52,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:29:52,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:29:52,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:29:52,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:29:52,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:29:52,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:29:52,781 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:29:52,796 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:29:52,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:29:52,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:29:52,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:29:52,798 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:29:52,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:29:52,798 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:29:52,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:29:52,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:29:52,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:29:52,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:29:52,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:29:52,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:29:52,799 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:29:52,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:29:52,800 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:29:52,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:29:52,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:29:52,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:29:52,801 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:29:52,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:29:52,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:29:52,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:29:52,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:29:52,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:29:52,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:29:52,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:29:52,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:29:52,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:29:52,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:29:52,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:29:52,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:29:52,851 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:29:52,852 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:29:52,852 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 13:29:52,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41426c46/8be749075e794a51982a044bc10bb274/FLAGfa5d206db [2019-09-08 13:29:53,836 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:29:53,838 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 13:29:53,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41426c46/8be749075e794a51982a044bc10bb274/FLAGfa5d206db [2019-09-08 13:29:54,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41426c46/8be749075e794a51982a044bc10bb274 [2019-09-08 13:29:54,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:29:54,246 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:29:54,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:29:54,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:29:54,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:29:54,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:29:54" (1/1) ... [2019-09-08 13:29:54,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eba365b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:29:54, skipping insertion in model container [2019-09-08 13:29:54,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:29:54" (1/1) ... [2019-09-08 13:29:54,264 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:29:54,808 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:29:58,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:29:58,913 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:30:02,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:30:02,141 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:30:02,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:02 WrapperNode [2019-09-08 13:30:02,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:30:02,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:30:02,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:30:02,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:30:02,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:02" (1/1) ... [2019-09-08 13:30:02,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:02" (1/1) ... [2019-09-08 13:30:02,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:02" (1/1) ... [2019-09-08 13:30:02,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:02" (1/1) ... [2019-09-08 13:30:02,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:02" (1/1) ... [2019-09-08 13:30:02,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:02" (1/1) ... [2019-09-08 13:30:02,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:02" (1/1) ... [2019-09-08 13:30:02,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:30:02,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:30:02,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:30:02,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:30:02,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:30:02,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:30:02,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:30:02,768 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:30:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:30:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:30:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:30:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:30:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:30:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:30:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:30:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:30:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:30:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:30:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:30:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:30:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:30:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:30:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:30:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:30:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:30:17,216 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:30:17,217 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:30:17,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:30:17 BoogieIcfgContainer [2019-09-08 13:30:17,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:30:17,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:30:17,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:30:17,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:30:17,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:29:54" (1/3) ... [2019-09-08 13:30:17,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9aac70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:30:17, skipping insertion in model container [2019-09-08 13:30:17,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:02" (2/3) ... [2019-09-08 13:30:17,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9aac70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:30:17, skipping insertion in model container [2019-09-08 13:30:17,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:30:17" (3/3) ... [2019-09-08 13:30:17,230 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 13:30:17,240 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:30:17,251 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:30:17,267 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:30:17,321 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:30:17,322 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:30:17,322 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:30:17,322 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:30:17,323 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:30:17,323 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:30:17,323 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:30:17,323 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:30:17,323 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:30:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6849 states. [2019-09-08 13:30:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 13:30:17,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:17,485 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:17,487 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:17,494 INFO L82 PathProgramCache]: Analyzing trace with hash -744909770, now seen corresponding path program 1 times [2019-09-08 13:30:17,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:17,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:17,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:17,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:17,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:18,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:18,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:18,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:18,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:18,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:18,591 INFO L87 Difference]: Start difference. First operand 6849 states. Second operand 3 states. [2019-09-08 13:30:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:19,261 INFO L93 Difference]: Finished difference Result 13641 states and 23639 transitions. [2019-09-08 13:30:19,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:19,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-08 13:30:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:19,324 INFO L225 Difference]: With dead ends: 13641 [2019-09-08 13:30:19,324 INFO L226 Difference]: Without dead ends: 8188 [2019-09-08 13:30:19,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8188 states. [2019-09-08 13:30:19,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8188 to 8186. [2019-09-08 13:30:19,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8186 states. [2019-09-08 13:30:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8186 states to 8186 states and 13709 transitions. [2019-09-08 13:30:19,730 INFO L78 Accepts]: Start accepts. Automaton has 8186 states and 13709 transitions. Word has length 372 [2019-09-08 13:30:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:19,733 INFO L475 AbstractCegarLoop]: Abstraction has 8186 states and 13709 transitions. [2019-09-08 13:30:19,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 8186 states and 13709 transitions. [2019-09-08 13:30:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 13:30:19,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:19,771 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:19,771 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:19,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:19,773 INFO L82 PathProgramCache]: Analyzing trace with hash -507662624, now seen corresponding path program 1 times [2019-09-08 13:30:19,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:19,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:19,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:19,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:19,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:20,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:20,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:20,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:20,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:20,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:20,397 INFO L87 Difference]: Start difference. First operand 8186 states and 13709 transitions. Second operand 3 states. [2019-09-08 13:30:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:21,437 INFO L93 Difference]: Finished difference Result 17841 states and 29983 transitions. [2019-09-08 13:30:21,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:21,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-08 13:30:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:21,521 INFO L225 Difference]: With dead ends: 17841 [2019-09-08 13:30:21,522 INFO L226 Difference]: Without dead ends: 10875 [2019-09-08 13:30:21,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10875 states. [2019-09-08 13:30:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10875 to 10873. [2019-09-08 13:30:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10873 states. [2019-09-08 13:30:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10873 states to 10873 states and 18184 transitions. [2019-09-08 13:30:22,179 INFO L78 Accepts]: Start accepts. Automaton has 10873 states and 18184 transitions. Word has length 372 [2019-09-08 13:30:22,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:22,181 INFO L475 AbstractCegarLoop]: Abstraction has 10873 states and 18184 transitions. [2019-09-08 13:30:22,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 10873 states and 18184 transitions. [2019-09-08 13:30:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 13:30:22,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:22,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:22,234 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:22,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:22,236 INFO L82 PathProgramCache]: Analyzing trace with hash 984938430, now seen corresponding path program 1 times [2019-09-08 13:30:22,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:22,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:22,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:22,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:22,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:22,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:22,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:22,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:22,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:22,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:22,828 INFO L87 Difference]: Start difference. First operand 10873 states and 18184 transitions. Second operand 3 states. [2019-09-08 13:30:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:23,876 INFO L93 Difference]: Finished difference Result 19411 states and 32517 transitions. [2019-09-08 13:30:23,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:23,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-08 13:30:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:23,954 INFO L225 Difference]: With dead ends: 19411 [2019-09-08 13:30:23,954 INFO L226 Difference]: Without dead ends: 17215 [2019-09-08 13:30:23,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17215 states. [2019-09-08 13:30:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17215 to 17213. [2019-09-08 13:30:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17213 states. [2019-09-08 13:30:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17213 states to 17213 states and 28782 transitions. [2019-09-08 13:30:24,624 INFO L78 Accepts]: Start accepts. Automaton has 17213 states and 28782 transitions. Word has length 372 [2019-09-08 13:30:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:24,625 INFO L475 AbstractCegarLoop]: Abstraction has 17213 states and 28782 transitions. [2019-09-08 13:30:24,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 17213 states and 28782 transitions. [2019-09-08 13:30:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 13:30:24,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:24,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:24,686 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:24,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash -578792770, now seen corresponding path program 1 times [2019-09-08 13:30:24,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:24,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:24,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:24,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:24,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:25,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:25,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:25,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:25,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:25,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:25,014 INFO L87 Difference]: Start difference. First operand 17213 states and 28782 transitions. Second operand 3 states. [2019-09-08 13:30:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:25,927 INFO L93 Difference]: Finished difference Result 19583 states and 32679 transitions. [2019-09-08 13:30:25,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:25,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-08 13:30:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:25,972 INFO L225 Difference]: With dead ends: 19583 [2019-09-08 13:30:25,972 INFO L226 Difference]: Without dead ends: 18077 [2019-09-08 13:30:25,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18077 states. [2019-09-08 13:30:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18077 to 17981. [2019-09-08 13:30:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17981 states. [2019-09-08 13:30:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17981 states to 17981 states and 30005 transitions. [2019-09-08 13:30:26,511 INFO L78 Accepts]: Start accepts. Automaton has 17981 states and 30005 transitions. Word has length 372 [2019-09-08 13:30:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:26,512 INFO L475 AbstractCegarLoop]: Abstraction has 17981 states and 30005 transitions. [2019-09-08 13:30:26,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 17981 states and 30005 transitions. [2019-09-08 13:30:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 13:30:26,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:26,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:26,565 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:26,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:26,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1174873915, now seen corresponding path program 1 times [2019-09-08 13:30:26,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:26,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:26,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:26,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:26,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:28,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:28,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:30:28,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:30:28,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:30:28,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:30:28,334 INFO L87 Difference]: Start difference. First operand 17981 states and 30005 transitions. Second operand 4 states. [2019-09-08 13:30:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:29,441 INFO L93 Difference]: Finished difference Result 38486 states and 64335 transitions. [2019-09-08 13:30:29,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:30:29,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2019-09-08 13:30:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:29,513 INFO L225 Difference]: With dead ends: 38486 [2019-09-08 13:30:29,514 INFO L226 Difference]: Without dead ends: 28164 [2019-09-08 13:30:29,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:30:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28164 states. [2019-09-08 13:30:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28164 to 26442. [2019-09-08 13:30:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26442 states. [2019-09-08 13:30:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26442 states to 26442 states and 44064 transitions. [2019-09-08 13:30:30,740 INFO L78 Accepts]: Start accepts. Automaton has 26442 states and 44064 transitions. Word has length 372 [2019-09-08 13:30:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:30,741 INFO L475 AbstractCegarLoop]: Abstraction has 26442 states and 44064 transitions. [2019-09-08 13:30:30,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:30:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 26442 states and 44064 transitions. [2019-09-08 13:30:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 13:30:30,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:30,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:30,800 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:30,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:30,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1380294817, now seen corresponding path program 1 times [2019-09-08 13:30:30,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:30,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:30,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:30,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:30,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:31,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:31,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:31,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:31,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:31,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:31,191 INFO L87 Difference]: Start difference. First operand 26442 states and 44064 transitions. Second operand 3 states. [2019-09-08 13:30:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:32,728 INFO L93 Difference]: Finished difference Result 51014 states and 85066 transitions. [2019-09-08 13:30:32,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:32,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-08 13:30:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:32,826 INFO L225 Difference]: With dead ends: 51014 [2019-09-08 13:30:32,826 INFO L226 Difference]: Without dead ends: 41664 [2019-09-08 13:30:32,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:32,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41664 states. [2019-09-08 13:30:34,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41664 to 41662. [2019-09-08 13:30:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41662 states. [2019-09-08 13:30:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41662 states to 41662 states and 69270 transitions. [2019-09-08 13:30:34,281 INFO L78 Accepts]: Start accepts. Automaton has 41662 states and 69270 transitions. Word has length 372 [2019-09-08 13:30:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:34,282 INFO L475 AbstractCegarLoop]: Abstraction has 41662 states and 69270 transitions. [2019-09-08 13:30:34,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 41662 states and 69270 transitions. [2019-09-08 13:30:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 13:30:34,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:34,333 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:34,333 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:34,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash 967796127, now seen corresponding path program 1 times [2019-09-08 13:30:34,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:34,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:34,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:34,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:34,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:34,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:34,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:34,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:34,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:34,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:34,902 INFO L87 Difference]: Start difference. First operand 41662 states and 69270 transitions. Second operand 3 states. [2019-09-08 13:30:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:38,977 INFO L93 Difference]: Finished difference Result 86914 states and 144712 transitions. [2019-09-08 13:30:38,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:38,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-08 13:30:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:39,096 INFO L225 Difference]: With dead ends: 86914 [2019-09-08 13:30:39,096 INFO L226 Difference]: Without dead ends: 74920 [2019-09-08 13:30:39,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:39,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74920 states. [2019-09-08 13:30:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74920 to 74918. [2019-09-08 13:30:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74918 states. [2019-09-08 13:30:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74918 states to 74918 states and 124266 transitions. [2019-09-08 13:30:41,188 INFO L78 Accepts]: Start accepts. Automaton has 74918 states and 124266 transitions. Word has length 372 [2019-09-08 13:30:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:41,189 INFO L475 AbstractCegarLoop]: Abstraction has 74918 states and 124266 transitions. [2019-09-08 13:30:41,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 74918 states and 124266 transitions. [2019-09-08 13:30:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 13:30:41,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:41,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:41,273 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1236804319, now seen corresponding path program 1 times [2019-09-08 13:30:41,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:41,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:41,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:41,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:41,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:41,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:41,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:41,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:41,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:41,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:41,872 INFO L87 Difference]: Start difference. First operand 74918 states and 124266 transitions. Second operand 3 states. [2019-09-08 13:30:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:44,338 INFO L93 Difference]: Finished difference Result 159266 states and 265188 transitions. [2019-09-08 13:30:44,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:30:44,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-08 13:30:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:44,491 INFO L225 Difference]: With dead ends: 159266 [2019-09-08 13:30:44,491 INFO L226 Difference]: Without dead ends: 87960 [2019-09-08 13:30:44,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87960 states. [2019-09-08 13:30:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87960 to 86222. [2019-09-08 13:30:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86222 states. [2019-09-08 13:30:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86222 states to 86222 states and 143262 transitions. [2019-09-08 13:30:49,054 INFO L78 Accepts]: Start accepts. Automaton has 86222 states and 143262 transitions. Word has length 372 [2019-09-08 13:30:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:49,055 INFO L475 AbstractCegarLoop]: Abstraction has 86222 states and 143262 transitions. [2019-09-08 13:30:49,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:30:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 86222 states and 143262 transitions. [2019-09-08 13:30:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 13:30:49,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:49,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:49,118 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:49,118 INFO L82 PathProgramCache]: Analyzing trace with hash 425696178, now seen corresponding path program 1 times [2019-09-08 13:30:49,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:49,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:49,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:49,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:49,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:49,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:49,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:30:49,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:30:49,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:30:49,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:30:49,943 INFO L87 Difference]: Start difference. First operand 86222 states and 143262 transitions. Second operand 4 states. [2019-09-08 13:30:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:55,779 INFO L93 Difference]: Finished difference Result 177972 states and 297281 transitions. [2019-09-08 13:30:55,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:30:55,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2019-09-08 13:30:55,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:55,980 INFO L225 Difference]: With dead ends: 177972 [2019-09-08 13:30:55,980 INFO L226 Difference]: Without dead ends: 147218 [2019-09-08 13:30:56,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:30:56,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147218 states. [2019-09-08 13:30:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147218 to 136270. [2019-09-08 13:30:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136270 states. [2019-09-08 13:30:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136270 states to 136270 states and 226798 transitions. [2019-09-08 13:30:59,448 INFO L78 Accepts]: Start accepts. Automaton has 136270 states and 226798 transitions. Word has length 372 [2019-09-08 13:30:59,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:59,449 INFO L475 AbstractCegarLoop]: Abstraction has 136270 states and 226798 transitions. [2019-09-08 13:30:59,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:30:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 136270 states and 226798 transitions. [2019-09-08 13:30:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 13:30:59,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:59,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:59,549 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1763988798, now seen corresponding path program 1 times [2019-09-08 13:30:59,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:59,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:59,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:59,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:59,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:59,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:59,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:59,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:59,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:59,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:59,917 INFO L87 Difference]: Start difference. First operand 136270 states and 226798 transitions. Second operand 3 states. [2019-09-08 13:31:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:07,975 INFO L93 Difference]: Finished difference Result 369134 states and 613562 transitions. [2019-09-08 13:31:07,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:07,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-08 13:31:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:08,331 INFO L225 Difference]: With dead ends: 369134 [2019-09-08 13:31:08,332 INFO L226 Difference]: Without dead ends: 235068 [2019-09-08 13:31:08,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235068 states. [2019-09-08 13:31:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235068 to 220402. [2019-09-08 13:31:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220402 states. [2019-09-08 13:31:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220402 states to 220402 states and 365704 transitions. [2019-09-08 13:31:18,677 INFO L78 Accepts]: Start accepts. Automaton has 220402 states and 365704 transitions. Word has length 376 [2019-09-08 13:31:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:18,678 INFO L475 AbstractCegarLoop]: Abstraction has 220402 states and 365704 transitions. [2019-09-08 13:31:18,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 220402 states and 365704 transitions. [2019-09-08 13:31:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 13:31:18,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:18,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:31:18,837 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:18,838 INFO L82 PathProgramCache]: Analyzing trace with hash -652451507, now seen corresponding path program 1 times [2019-09-08 13:31:18,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:18,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:18,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:18,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:18,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:31:19,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:19,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:19,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:19,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:19,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:19,219 INFO L87 Difference]: Start difference. First operand 220402 states and 365704 transitions. Second operand 3 states. [2019-09-08 13:31:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:25,116 INFO L93 Difference]: Finished difference Result 432614 states and 718722 transitions. [2019-09-08 13:31:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:25,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-08 13:31:25,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:25,418 INFO L225 Difference]: With dead ends: 432614 [2019-09-08 13:31:25,418 INFO L226 Difference]: Without dead ends: 220404 [2019-09-08 13:31:25,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220404 states. [2019-09-08 13:31:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220404 to 220402. [2019-09-08 13:31:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220402 states. [2019-09-08 13:31:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220402 states to 220402 states and 365140 transitions. [2019-09-08 13:31:36,708 INFO L78 Accepts]: Start accepts. Automaton has 220402 states and 365140 transitions. Word has length 376 [2019-09-08 13:31:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:36,709 INFO L475 AbstractCegarLoop]: Abstraction has 220402 states and 365140 transitions. [2019-09-08 13:31:36,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 220402 states and 365140 transitions. [2019-09-08 13:31:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 13:31:36,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:36,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:31:36,868 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:36,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:36,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1401984827, now seen corresponding path program 1 times [2019-09-08 13:31:36,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:36,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:36,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:36,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:36,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:31:37,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:37,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:37,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:37,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:37,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:37,286 INFO L87 Difference]: Start difference. First operand 220402 states and 365140 transitions. Second operand 3 states. [2019-09-08 13:31:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:40,846 INFO L93 Difference]: Finished difference Result 272918 states and 453238 transitions. [2019-09-08 13:31:40,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:40,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-08 13:31:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:41,019 INFO L225 Difference]: With dead ends: 272918 [2019-09-08 13:31:41,019 INFO L226 Difference]: Without dead ends: 94372 [2019-09-08 13:31:41,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94372 states. [2019-09-08 13:31:48,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94372 to 78402. [2019-09-08 13:31:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78402 states. [2019-09-08 13:31:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78402 states to 78402 states and 130316 transitions. [2019-09-08 13:31:48,166 INFO L78 Accepts]: Start accepts. Automaton has 78402 states and 130316 transitions. Word has length 376 [2019-09-08 13:31:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:48,167 INFO L475 AbstractCegarLoop]: Abstraction has 78402 states and 130316 transitions. [2019-09-08 13:31:48,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 78402 states and 130316 transitions. [2019-09-08 13:31:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 13:31:48,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:48,208 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:31:48,208 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:48,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2110471814, now seen corresponding path program 1 times [2019-09-08 13:31:48,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:48,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:48,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:48,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:31:48,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:48,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:48,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:48,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:48,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:48,587 INFO L87 Difference]: Start difference. First operand 78402 states and 130316 transitions. Second operand 3 states. [2019-09-08 13:31:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:51,552 INFO L93 Difference]: Finished difference Result 148390 states and 246382 transitions. [2019-09-08 13:31:51,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:51,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-08 13:31:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:51,694 INFO L225 Difference]: With dead ends: 148390 [2019-09-08 13:31:51,694 INFO L226 Difference]: Without dead ends: 111780 [2019-09-08 13:31:51,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111780 states. [2019-09-08 13:31:55,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111780 to 111522. [2019-09-08 13:31:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111522 states. [2019-09-08 13:31:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111522 states to 111522 states and 184492 transitions. [2019-09-08 13:31:55,888 INFO L78 Accepts]: Start accepts. Automaton has 111522 states and 184492 transitions. Word has length 376 [2019-09-08 13:31:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:55,889 INFO L475 AbstractCegarLoop]: Abstraction has 111522 states and 184492 transitions. [2019-09-08 13:31:55,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 111522 states and 184492 transitions. [2019-09-08 13:31:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-08 13:31:55,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:55,935 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:31:55,936 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash 454188724, now seen corresponding path program 1 times [2019-09-08 13:31:55,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:55,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:55,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:55,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:55,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:31:56,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:56,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:31:56,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:31:56,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:31:56,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:31:56,653 INFO L87 Difference]: Start difference. First operand 111522 states and 184492 transitions. Second operand 5 states. [2019-09-08 13:32:01,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:01,534 INFO L93 Difference]: Finished difference Result 216326 states and 357929 transitions. [2019-09-08 13:32:01,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:32:01,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 377 [2019-09-08 13:32:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:01,708 INFO L225 Difference]: With dead ends: 216326 [2019-09-08 13:32:01,708 INFO L226 Difference]: Without dead ends: 134266 [2019-09-08 13:32:01,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:32:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134266 states. [2019-09-08 13:32:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134266 to 118342. [2019-09-08 13:32:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118342 states. [2019-09-08 13:32:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118342 states to 118342 states and 195132 transitions. [2019-09-08 13:32:07,697 INFO L78 Accepts]: Start accepts. Automaton has 118342 states and 195132 transitions. Word has length 377 [2019-09-08 13:32:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:07,698 INFO L475 AbstractCegarLoop]: Abstraction has 118342 states and 195132 transitions. [2019-09-08 13:32:07,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:32:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 118342 states and 195132 transitions. [2019-09-08 13:32:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-08 13:32:07,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:07,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:07,771 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:07,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:07,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1627476068, now seen corresponding path program 1 times [2019-09-08 13:32:07,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:07,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:07,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:08,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:08,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:32:08,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:32:08,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:32:08,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:32:08,258 INFO L87 Difference]: Start difference. First operand 118342 states and 195132 transitions. Second operand 6 states. [2019-09-08 13:32:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:18,904 INFO L93 Difference]: Finished difference Result 306106 states and 507692 transitions. [2019-09-08 13:32:18,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:32:18,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 377 [2019-09-08 13:32:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:19,248 INFO L225 Difference]: With dead ends: 306106 [2019-09-08 13:32:19,249 INFO L226 Difference]: Without dead ends: 236280 [2019-09-08 13:32:19,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:32:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236280 states. [2019-09-08 13:32:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236280 to 227378. [2019-09-08 13:32:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227378 states. [2019-09-08 13:32:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227378 states to 227378 states and 376360 transitions. [2019-09-08 13:32:28,342 INFO L78 Accepts]: Start accepts. Automaton has 227378 states and 376360 transitions. Word has length 377 [2019-09-08 13:32:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:28,343 INFO L475 AbstractCegarLoop]: Abstraction has 227378 states and 376360 transitions. [2019-09-08 13:32:28,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:32:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 227378 states and 376360 transitions. [2019-09-08 13:32:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-08 13:32:32,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:32,121 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:32:32,121 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:32,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:32,121 INFO L82 PathProgramCache]: Analyzing trace with hash -414176259, now seen corresponding path program 1 times [2019-09-08 13:32:32,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:32,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:32,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:32,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:32,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:32:33,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:33,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:32:33,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:32:33,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:32:33,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:32:33,090 INFO L87 Difference]: Start difference. First operand 227378 states and 376360 transitions. Second operand 8 states. [2019-09-08 13:33:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:33:53,581 INFO L93 Difference]: Finished difference Result 1742678 states and 2876554 transitions. [2019-09-08 13:33:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:33:53,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 377 [2019-09-08 13:33:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:33:56,351 INFO L225 Difference]: With dead ends: 1742678 [2019-09-08 13:33:56,351 INFO L226 Difference]: Without dead ends: 1560252 [2019-09-08 13:33:56,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:33:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560252 states. [2019-09-08 13:35:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560252 to 1026480. [2019-09-08 13:35:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026480 states. [2019-09-08 13:35:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026480 states to 1026480 states and 1695007 transitions. [2019-09-08 13:35:28,256 INFO L78 Accepts]: Start accepts. Automaton has 1026480 states and 1695007 transitions. Word has length 377 [2019-09-08 13:35:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:35:28,257 INFO L475 AbstractCegarLoop]: Abstraction has 1026480 states and 1695007 transitions. [2019-09-08 13:35:28,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:35:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1026480 states and 1695007 transitions. [2019-09-08 13:35:28,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-08 13:35:28,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:35:28,392 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:35:28,393 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:35:28,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:35:28,393 INFO L82 PathProgramCache]: Analyzing trace with hash -496644165, now seen corresponding path program 1 times [2019-09-08 13:35:28,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:35:28,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:35:28,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:35:28,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:35:28,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:35:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:35:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:35:39,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:35:39,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:35:39,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:35:39,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:35:39,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:35:39,707 INFO L87 Difference]: Start difference. First operand 1026480 states and 1695007 transitions. Second operand 5 states.